./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_buf_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_cursor_from_buf_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 13ec24500153ff48401c44b6cbf6e64bbffda498093f21927cfcfb52ad2376ab --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:43:08,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:43:08,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:43:08,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:43:08,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:43:08,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:43:08,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:43:08,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:43:08,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:43:08,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:43:08,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:43:08,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:43:08,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:43:08,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:43:08,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:43:08,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:43:08,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:43:08,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:43:08,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:43:08,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:43:08,737 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:43:08,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:43:08,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:43:08,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:43:08,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:43:08,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:43:08,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:43:08,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:43:08,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:43:08,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:43:08,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:43:08,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:43:08,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:43:08,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:43:08,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:43:08,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:43:08,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:43:08,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:43:08,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:43:08,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:43:08,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:43:08,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:43:08,758 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:43:08,789 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:43:08,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:43:08,790 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:43:08,790 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:43:08,790 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:43:08,791 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:43:08,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:43:08,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:43:08,792 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:43:08,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:43:08,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:43:08,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:43:08,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:43:08,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:43:08,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:43:08,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:43:08,794 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:43:08,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:43:08,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:43:08,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:43:08,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:43:08,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:43:08,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:43:08,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:43:08,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:43:08,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:43:08,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:43:08,797 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:43:08,798 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:43:08,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:43:08,798 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 -> 13ec24500153ff48401c44b6cbf6e64bbffda498093f21927cfcfb52ad2376ab [2022-07-13 22:43:09,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:43:09,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:43:09,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:43:09,072 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:43:09,073 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:43:09,074 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_buf_harness.i [2022-07-13 22:43:09,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83497b37e/fee690e429ee4ef19c57c2c01cab3806/FLAG11d55e1d4 [2022-07-13 22:43:09,792 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:43:09,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_buf_harness.i [2022-07-13 22:43:09,826 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83497b37e/fee690e429ee4ef19c57c2c01cab3806/FLAG11d55e1d4 [2022-07-13 22:43:10,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83497b37e/fee690e429ee4ef19c57c2c01cab3806 [2022-07-13 22:43:10,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:43:10,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:43:10,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:43:10,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:43:10,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:43:10,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:43:10" (1/1) ... [2022-07-13 22:43:10,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449b3e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:43:10, skipping insertion in model container [2022-07-13 22:43:10,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:43:10" (1/1) ... [2022-07-13 22:43:10,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:43:10,254 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:43:10,471 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_cursor_from_buf_harness.i[4498,4511] [2022-07-13 22:43:10,477 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_cursor_from_buf_harness.i[4558,4571] [2022-07-13 22:43:11,112 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,112 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,113 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,113 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,114 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,125 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,125 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,127 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,127 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,375 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:43:11,376 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:43:11,377 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:43:11,378 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:43:11,379 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:43:11,387 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:43:11,389 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:43:11,391 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:43:11,392 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:43:11,392 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:43:11,531 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:43:11,610 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,620 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:43:11,714 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:43:11,726 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_cursor_from_buf_harness.i[4498,4511] [2022-07-13 22:43:11,726 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_cursor_from_buf_harness.i[4558,4571] [2022-07-13 22:43:11,752 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,752 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,752 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,753 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,753 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,758 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,761 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,762 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,764 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,796 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:43:11,803 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:43:11,804 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:43:11,804 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:43:11,805 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:43:11,806 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:43:11,806 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:43:11,809 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:43:11,809 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:43:11,809 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:43:11,833 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:43:11,957 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,962 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:43:11,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:43:12,132 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:43:12,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:43:12 WrapperNode [2022-07-13 22:43:12,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:43:12,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:43:12,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:43:12,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:43:12,140 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:43:12" (1/1) ... [2022-07-13 22:43:12,245 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:43:12" (1/1) ... [2022-07-13 22:43:12,308 INFO L137 Inliner]: procedures = 690, calls = 2639, calls flagged for inlining = 61, calls inlined = 9, statements flattened = 868 [2022-07-13 22:43:12,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:43:12,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:43:12,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:43:12,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:43:12,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:43:12" (1/1) ... [2022-07-13 22:43:12,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:43:12" (1/1) ... [2022-07-13 22:43:12,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:43:12" (1/1) ... [2022-07-13 22:43:12,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:43:12" (1/1) ... [2022-07-13 22:43:12,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:43:12" (1/1) ... [2022-07-13 22:43:12,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:43:12" (1/1) ... [2022-07-13 22:43:12,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:43:12" (1/1) ... [2022-07-13 22:43:12,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:43:12,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:43:12,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:43:12,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:43:12,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:43:12" (1/1) ... [2022-07-13 22:43:12,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:43:12,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:12,461 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:43:12,494 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:43:12,515 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-13 22:43:12,515 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-13 22:43:12,516 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-13 22:43:12,516 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-13 22:43:12,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:43:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:43:12,517 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:43:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:43:12,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:43:12,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:43:12,518 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_from_buf [2022-07-13 22:43:12,519 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_from_buf [2022-07-13 22:43:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:43:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:43:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:43:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:43:12,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:43:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:43:12,521 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:43:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-13 22:43:12,521 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-13 22:43:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:43:12,522 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:43:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:43:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:43:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:43:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-13 22:43:12,522 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-13 22:43:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-13 22:43:12,523 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-13 22:43:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:43:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:43:12,826 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:43:12,833 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:43:13,882 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:43:13,891 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:43:13,892 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 22:43:13,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:43:13 BoogieIcfgContainer [2022-07-13 22:43:13,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:43:13,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:43:13,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:43:13,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:43:13,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:43:10" (1/3) ... [2022-07-13 22:43:13,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496bfbdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:43:13, skipping insertion in model container [2022-07-13 22:43:13,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:43:12" (2/3) ... [2022-07-13 22:43:13,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496bfbdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:43:13, skipping insertion in model container [2022-07-13 22:43:13,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:43:13" (3/3) ... [2022-07-13 22:43:13,903 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_buf_harness.i [2022-07-13 22:43:13,917 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:43:13,917 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:43:13,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:43:13,997 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@78ecfcb5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c047153 [2022-07-13 22:43:13,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:43:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 88 states have (on average 1.25) internal successors, (110), 89 states have internal predecessors, (110), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-07-13 22:43:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 22:43:14,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:14,013 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-13 22:43:14,013 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:14,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:14,019 INFO L85 PathProgramCache]: Analyzing trace with hash -963084782, now seen corresponding path program 1 times [2022-07-13 22:43:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:14,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593006835] [2022-07-13 22:43:14,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:14,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 22:43:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:43:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 22:43:14,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:14,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593006835] [2022-07-13 22:43:14,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593006835] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:14,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:14,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 22:43:14,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736451419] [2022-07-13 22:43:14,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:14,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:43:14,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:14,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:43:14,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:43:14,703 INFO L87 Difference]: Start difference. First operand has 128 states, 88 states have (on average 1.25) internal successors, (110), 89 states have internal predecessors, (110), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 22:43:14,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:14,948 INFO L93 Difference]: Finished difference Result 252 states and 347 transitions. [2022-07-13 22:43:14,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:43:14,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2022-07-13 22:43:14,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:14,970 INFO L225 Difference]: With dead ends: 252 [2022-07-13 22:43:14,970 INFO L226 Difference]: Without dead ends: 121 [2022-07-13 22:43:14,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:43:14,987 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 61 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:14,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 199 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:43:15,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-13 22:43:15,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-13 22:43:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 83 states have internal predecessors, (100), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-13 22:43:15,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 155 transitions. [2022-07-13 22:43:15,048 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 155 transitions. Word has length 65 [2022-07-13 22:43:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:15,049 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 155 transitions. [2022-07-13 22:43:15,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 22:43:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 155 transitions. [2022-07-13 22:43:15,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 22:43:15,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:15,055 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-13 22:43:15,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:43:15,056 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:15,056 INFO L85 PathProgramCache]: Analyzing trace with hash 178526858, now seen corresponding path program 1 times [2022-07-13 22:43:15,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:15,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515489295] [2022-07-13 22:43:15,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:15,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:15,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:15,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:15,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:15,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:15,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:15,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 22:43:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:15,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:15,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:43:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 22:43:15,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:15,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515489295] [2022-07-13 22:43:15,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515489295] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:15,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992438414] [2022-07-13 22:43:15,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:15,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:15,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:15,432 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:43:15,433 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:43:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:15,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 2571 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 22:43:15,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 22:43:16,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:16,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992438414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:16,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:16,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-07-13 22:43:16,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864277076] [2022-07-13 22:43:16,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:16,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:43:16,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:16,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:43:16,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:43:16,138 INFO L87 Difference]: Start difference. First operand 121 states and 155 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 22:43:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:16,301 INFO L93 Difference]: Finished difference Result 220 states and 286 transitions. [2022-07-13 22:43:16,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:43:16,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 65 [2022-07-13 22:43:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:16,308 INFO L225 Difference]: With dead ends: 220 [2022-07-13 22:43:16,308 INFO L226 Difference]: Without dead ends: 124 [2022-07-13 22:43:16,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:43:16,312 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 181 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:16,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 330 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:43:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-13 22:43:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-13 22:43:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 86 states have internal predecessors, (102), 28 states have call successors, (28), 10 states have call predecessors, (28), 11 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-07-13 22:43:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 158 transitions. [2022-07-13 22:43:16,335 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 158 transitions. Word has length 65 [2022-07-13 22:43:16,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:16,335 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 158 transitions. [2022-07-13 22:43:16,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 22:43:16,336 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 158 transitions. [2022-07-13 22:43:16,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 22:43:16,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:16,342 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:43:16,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 22:43:16,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:16,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:16,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:16,556 INFO L85 PathProgramCache]: Analyzing trace with hash 253294421, now seen corresponding path program 1 times [2022-07-13 22:43:16,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:16,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803371158] [2022-07-13 22:43:16,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:16,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:43:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:43:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:43:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 22:43:16,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:16,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803371158] [2022-07-13 22:43:16,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803371158] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:16,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804633071] [2022-07-13 22:43:16,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:16,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:16,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:16,977 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:43:16,979 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:43:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:17,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 2588 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:43:17,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 22:43:17,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:17,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804633071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:17,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:17,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2022-07-13 22:43:17,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618811108] [2022-07-13 22:43:17,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:17,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:43:17,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:17,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:43:17,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:43:17,590 INFO L87 Difference]: Start difference. First operand 124 states and 158 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 22:43:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:17,850 INFO L93 Difference]: Finished difference Result 213 states and 272 transitions. [2022-07-13 22:43:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:43:17,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 71 [2022-07-13 22:43:17,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:17,853 INFO L225 Difference]: With dead ends: 213 [2022-07-13 22:43:17,854 INFO L226 Difference]: Without dead ends: 121 [2022-07-13 22:43:17,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:43:17,856 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 180 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:17,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 637 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:43:17,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-13 22:43:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-13 22:43:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 83 states have internal predecessors, (99), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-13 22:43:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 154 transitions. [2022-07-13 22:43:17,864 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 154 transitions. Word has length 71 [2022-07-13 22:43:17,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:17,865 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 154 transitions. [2022-07-13 22:43:17,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 22:43:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 154 transitions. [2022-07-13 22:43:17,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-13 22:43:17,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:17,866 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-13 22:43:17,897 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:43:18,087 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,SelfDestructingSolverStorable2 [2022-07-13 22:43:18,088 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:18,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:18,088 INFO L85 PathProgramCache]: Analyzing trace with hash -241480736, now seen corresponding path program 1 times [2022-07-13 22:43:18,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:18,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377023080] [2022-07-13 22:43:18,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:18,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:43:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:43:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:43:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 22:43:18,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:18,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377023080] [2022-07-13 22:43:18,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377023080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:18,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:18,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:43:18,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980841246] [2022-07-13 22:43:18,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:18,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:43:18,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:18,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:43:18,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:43:18,384 INFO L87 Difference]: Start difference. First operand 121 states and 154 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 22:43:18,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:18,652 INFO L93 Difference]: Finished difference Result 207 states and 264 transitions. [2022-07-13 22:43:18,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:43:18,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 77 [2022-07-13 22:43:18,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:18,654 INFO L225 Difference]: With dead ends: 207 [2022-07-13 22:43:18,654 INFO L226 Difference]: Without dead ends: 124 [2022-07-13 22:43:18,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:43:18,655 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 77 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:18,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 309 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:43:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-13 22:43:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-13 22:43:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 84 states have (on average 1.2023809523809523) internal successors, (101), 86 states have internal predecessors, (101), 28 states have call successors, (28), 10 states have call predecessors, (28), 11 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-07-13 22:43:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 157 transitions. [2022-07-13 22:43:18,664 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 157 transitions. Word has length 77 [2022-07-13 22:43:18,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:18,664 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 157 transitions. [2022-07-13 22:43:18,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 22:43:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-07-13 22:43:18,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-13 22:43:18,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:18,666 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-13 22:43:18,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:43:18,667 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:18,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1300692571, now seen corresponding path program 1 times [2022-07-13 22:43:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:18,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981419485] [2022-07-13 22:43:18,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:18,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:43:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:43:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:43:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 22:43:18,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:18,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981419485] [2022-07-13 22:43:18,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981419485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:18,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:18,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:43:18,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204619540] [2022-07-13 22:43:18,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:18,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:43:18,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:18,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:43:18,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:43:18,968 INFO L87 Difference]: Start difference. First operand 124 states and 157 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-13 22:43:19,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:19,510 INFO L93 Difference]: Finished difference Result 136 states and 170 transitions. [2022-07-13 22:43:19,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:43:19,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 79 [2022-07-13 22:43:19,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:19,512 INFO L225 Difference]: With dead ends: 136 [2022-07-13 22:43:19,512 INFO L226 Difference]: Without dead ends: 134 [2022-07-13 22:43:19,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:43:19,513 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 79 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:19,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 573 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:43:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-13 22:43:19,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-07-13 22:43:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 29 states have call successors, (29), 11 states have call predecessors, (29), 13 states have return successors, (31), 28 states have call predecessors, (31), 28 states have call successors, (31) [2022-07-13 22:43:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 167 transitions. [2022-07-13 22:43:19,524 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 167 transitions. Word has length 79 [2022-07-13 22:43:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:19,525 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 167 transitions. [2022-07-13 22:43:19,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-13 22:43:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 167 transitions. [2022-07-13 22:43:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-13 22:43:19,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:19,526 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-13 22:43:19,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:43:19,527 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:19,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:19,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1177544493, now seen corresponding path program 1 times [2022-07-13 22:43:19,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:19,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690571456] [2022-07-13 22:43:19,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:19,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:43:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:43:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:43:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 22:43:20,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:20,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690571456] [2022-07-13 22:43:20,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690571456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:20,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:20,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-13 22:43:20,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360294212] [2022-07-13 22:43:20,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:20,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 22:43:20,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:20,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 22:43:20,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:43:20,126 INFO L87 Difference]: Start difference. First operand 133 states and 167 transitions. Second operand has 18 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 9 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 22:43:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:21,431 INFO L93 Difference]: Finished difference Result 264 states and 343 transitions. [2022-07-13 22:43:21,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:43:21,432 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 9 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 83 [2022-07-13 22:43:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:21,434 INFO L225 Difference]: With dead ends: 264 [2022-07-13 22:43:21,434 INFO L226 Difference]: Without dead ends: 174 [2022-07-13 22:43:21,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2022-07-13 22:43:21,435 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 207 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:21,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 476 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 22:43:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-13 22:43:21,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 144. [2022-07-13 22:43:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.1789473684210525) internal successors, (112), 99 states have internal predecessors, (112), 34 states have call successors, (34), 12 states have call predecessors, (34), 14 states have return successors, (36), 32 states have call predecessors, (36), 33 states have call successors, (36) [2022-07-13 22:43:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions. [2022-07-13 22:43:21,459 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 182 transitions. Word has length 83 [2022-07-13 22:43:21,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:21,459 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 182 transitions. [2022-07-13 22:43:21,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 9 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 22:43:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2022-07-13 22:43:21,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 22:43:21,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:21,466 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:43:21,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 22:43:21,466 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:21,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash 340573773, now seen corresponding path program 1 times [2022-07-13 22:43:21,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:21,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837850154] [2022-07-13 22:43:21,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:21,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:21,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:21,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:21,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:21,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:21,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:21,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:43:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:21,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:43:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:21,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:43:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:21,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:43:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:21,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:43:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 22:43:22,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:22,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837850154] [2022-07-13 22:43:22,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837850154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:22,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:22,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-13 22:43:22,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025946670] [2022-07-13 22:43:22,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:22,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 22:43:22,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:22,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 22:43:22,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:43:22,043 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. Second operand has 16 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 22:43:23,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:23,238 INFO L93 Difference]: Finished difference Result 260 states and 335 transitions. [2022-07-13 22:43:23,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 22:43:23,239 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 90 [2022-07-13 22:43:23,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:23,241 INFO L225 Difference]: With dead ends: 260 [2022-07-13 22:43:23,241 INFO L226 Difference]: Without dead ends: 170 [2022-07-13 22:43:23,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2022-07-13 22:43:23,242 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 192 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:23,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 703 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 22:43:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-13 22:43:23,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 159. [2022-07-13 22:43:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 112 states have internal predecessors, (128), 36 states have call successors, (36), 12 states have call predecessors, (36), 15 states have return successors, (42), 34 states have call predecessors, (42), 35 states have call successors, (42) [2022-07-13 22:43:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 206 transitions. [2022-07-13 22:43:23,255 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 206 transitions. Word has length 90 [2022-07-13 22:43:23,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:23,256 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 206 transitions. [2022-07-13 22:43:23,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 22:43:23,256 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 206 transitions. [2022-07-13 22:43:23,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 22:43:23,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:23,257 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:43:23,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 22:43:23,258 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:23,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:23,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1726777167, now seen corresponding path program 1 times [2022-07-13 22:43:23,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:23,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345933654] [2022-07-13 22:43:23,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:23,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:43:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:43:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:43:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:43:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:43:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-13 22:43:23,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:23,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345933654] [2022-07-13 22:43:23,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345933654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:23,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:23,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:43:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112510855] [2022-07-13 22:43:23,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:23,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:43:23,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:23,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:43:23,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:43:23,473 INFO L87 Difference]: Start difference. First operand 159 states and 206 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:43:23,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:23,707 INFO L93 Difference]: Finished difference Result 293 states and 388 transitions. [2022-07-13 22:43:23,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:43:23,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 90 [2022-07-13 22:43:23,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:23,709 INFO L225 Difference]: With dead ends: 293 [2022-07-13 22:43:23,709 INFO L226 Difference]: Without dead ends: 159 [2022-07-13 22:43:23,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:43:23,710 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 80 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:23,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 329 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:43:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-13 22:43:23,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-07-13 22:43:23,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 107 states have (on average 1.1869158878504673) internal successors, (127), 112 states have internal predecessors, (127), 36 states have call successors, (36), 12 states have call predecessors, (36), 15 states have return successors, (42), 34 states have call predecessors, (42), 35 states have call successors, (42) [2022-07-13 22:43:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 205 transitions. [2022-07-13 22:43:23,722 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 205 transitions. Word has length 90 [2022-07-13 22:43:23,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:23,722 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 205 transitions. [2022-07-13 22:43:23,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:43:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 205 transitions. [2022-07-13 22:43:23,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 22:43:23,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:23,724 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:43:23,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 22:43:23,724 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:23,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:23,725 INFO L85 PathProgramCache]: Analyzing trace with hash 383299479, now seen corresponding path program 1 times [2022-07-13 22:43:23,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:23,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913858024] [2022-07-13 22:43:23,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:23,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:43:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:43:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:43:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:23,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:43:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:43:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 22:43:24,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:24,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913858024] [2022-07-13 22:43:24,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913858024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:24,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:24,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:43:24,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437191596] [2022-07-13 22:43:24,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:24,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:43:24,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:24,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:43:24,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:43:24,037 INFO L87 Difference]: Start difference. First operand 159 states and 205 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 22:43:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:24,514 INFO L93 Difference]: Finished difference Result 289 states and 375 transitions. [2022-07-13 22:43:24,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:43:24,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2022-07-13 22:43:24,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:24,516 INFO L225 Difference]: With dead ends: 289 [2022-07-13 22:43:24,516 INFO L226 Difference]: Without dead ends: 169 [2022-07-13 22:43:24,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:43:24,517 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 72 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:24,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 643 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:43:24,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-13 22:43:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2022-07-13 22:43:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 117 states have internal predecessors, (131), 36 states have call successors, (36), 12 states have call predecessors, (36), 16 states have return successors, (44), 34 states have call predecessors, (44), 35 states have call successors, (44) [2022-07-13 22:43:24,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 211 transitions. [2022-07-13 22:43:24,531 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 211 transitions. Word has length 94 [2022-07-13 22:43:24,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:24,532 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 211 transitions. [2022-07-13 22:43:24,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 22:43:24,532 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 211 transitions. [2022-07-13 22:43:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 22:43:24,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:24,534 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:43:24,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 22:43:24,534 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:24,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:24,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1721484580, now seen corresponding path program 1 times [2022-07-13 22:43:24,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:24,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357805677] [2022-07-13 22:43:24,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:24,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:43:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:43:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:43:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:43:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:43:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 22:43:24,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:24,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357805677] [2022-07-13 22:43:24,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357805677] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:24,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888813251] [2022-07-13 22:43:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:24,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:24,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:24,896 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:43:24,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 22:43:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:25,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 2679 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 22:43:25,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 22:43:25,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:25,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888813251] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:25,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:25,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-07-13 22:43:25,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088792074] [2022-07-13 22:43:25,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:25,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:43:25,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:25,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:43:25,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:43:25,515 INFO L87 Difference]: Start difference. First operand 164 states and 211 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:43:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:25,788 INFO L93 Difference]: Finished difference Result 335 states and 441 transitions. [2022-07-13 22:43:25,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:43:25,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2022-07-13 22:43:25,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:25,790 INFO L225 Difference]: With dead ends: 335 [2022-07-13 22:43:25,790 INFO L226 Difference]: Without dead ends: 196 [2022-07-13 22:43:25,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:43:25,791 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 34 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:25,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 660 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 42 Unchecked, 0.2s Time] [2022-07-13 22:43:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-13 22:43:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 172. [2022-07-13 22:43:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 119 states have (on average 1.1932773109243697) internal successors, (142), 125 states have internal predecessors, (142), 36 states have call successors, (36), 12 states have call predecessors, (36), 16 states have return successors, (44), 34 states have call predecessors, (44), 35 states have call successors, (44) [2022-07-13 22:43:25,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 222 transitions. [2022-07-13 22:43:25,817 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 222 transitions. Word has length 96 [2022-07-13 22:43:25,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:25,818 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 222 transitions. [2022-07-13 22:43:25,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:43:25,818 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 222 transitions. [2022-07-13 22:43:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 22:43:25,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:25,819 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:43:25,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 22:43:26,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:26,040 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:26,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:26,040 INFO L85 PathProgramCache]: Analyzing trace with hash -335281186, now seen corresponding path program 1 times [2022-07-13 22:43:26,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:26,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732878922] [2022-07-13 22:43:26,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:26,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:43:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:43:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:43:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:43:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:43:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 22:43:26,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:26,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732878922] [2022-07-13 22:43:26,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732878922] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:26,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031693003] [2022-07-13 22:43:26,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:26,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:26,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:26,679 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:43:26,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 22:43:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:27,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 2684 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:43:27,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 22:43:41,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:41,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031693003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:41,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:41,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [22] total 24 [2022-07-13 22:43:41,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243374564] [2022-07-13 22:43:41,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:41,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:43:41,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:41,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:43:41,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=488, Unknown=7, NotChecked=0, Total=552 [2022-07-13 22:43:41,342 INFO L87 Difference]: Start difference. First operand 172 states and 222 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:43:41,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:41,491 INFO L93 Difference]: Finished difference Result 340 states and 453 transitions. [2022-07-13 22:43:41,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:43:41,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2022-07-13 22:43:41,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:41,493 INFO L225 Difference]: With dead ends: 340 [2022-07-13 22:43:41,493 INFO L226 Difference]: Without dead ends: 193 [2022-07-13 22:43:41,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=63, Invalid=530, Unknown=7, NotChecked=0, Total=600 [2022-07-13 22:43:41,494 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 23 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:41,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 533 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-07-13 22:43:41,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-13 22:43:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 175. [2022-07-13 22:43:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 122 states have (on average 1.1885245901639345) internal successors, (145), 128 states have internal predecessors, (145), 36 states have call successors, (36), 12 states have call predecessors, (36), 16 states have return successors, (44), 34 states have call predecessors, (44), 35 states have call successors, (44) [2022-07-13 22:43:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 225 transitions. [2022-07-13 22:43:41,506 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 225 transitions. Word has length 96 [2022-07-13 22:43:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:41,506 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 225 transitions. [2022-07-13 22:43:41,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:43:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 225 transitions. [2022-07-13 22:43:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 22:43:41,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:41,508 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:43:41,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 22:43:41,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:41,736 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash -60521572, now seen corresponding path program 1 times [2022-07-13 22:43:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:41,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650441086] [2022-07-13 22:43:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:41,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:41,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:41,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:41,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:41,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:41,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:43:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:41,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:43:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:41,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:43:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:41,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:43:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:41,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:43:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-13 22:43:41,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:41,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650441086] [2022-07-13 22:43:41,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650441086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:41,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:41,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:43:41,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082148718] [2022-07-13 22:43:41,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:41,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:43:41,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:41,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:43:41,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:43:41,960 INFO L87 Difference]: Start difference. First operand 175 states and 225 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:43:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:42,207 INFO L93 Difference]: Finished difference Result 331 states and 437 transitions. [2022-07-13 22:43:42,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:43:42,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2022-07-13 22:43:42,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:42,209 INFO L225 Difference]: With dead ends: 331 [2022-07-13 22:43:42,209 INFO L226 Difference]: Without dead ends: 181 [2022-07-13 22:43:42,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:43:42,211 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 73 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:42,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 317 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:43:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-13 22:43:42,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2022-07-13 22:43:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 120 states have (on average 1.1833333333333333) internal successors, (142), 126 states have internal predecessors, (142), 36 states have call successors, (36), 12 states have call predecessors, (36), 16 states have return successors, (44), 34 states have call predecessors, (44), 35 states have call successors, (44) [2022-07-13 22:43:42,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 222 transitions. [2022-07-13 22:43:42,227 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 222 transitions. Word has length 96 [2022-07-13 22:43:42,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:42,227 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 222 transitions. [2022-07-13 22:43:42,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:43:42,227 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 222 transitions. [2022-07-13 22:43:42,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 22:43:42,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:42,229 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:43:42,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 22:43:42,230 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:42,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:42,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1061953058, now seen corresponding path program 1 times [2022-07-13 22:43:42,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:42,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760722791] [2022-07-13 22:43:42,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:42,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:42,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:42,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:42,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:42,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:42,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:42,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:43:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:42,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:43:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:42,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:43:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:42,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:43:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:42,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:43:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 22:43:42,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:42,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760722791] [2022-07-13 22:43:42,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760722791] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:42,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5382428] [2022-07-13 22:43:42,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:42,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:42,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:42,562 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:43:42,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 22:43:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 2676 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-13 22:43:43,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:43,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:43:43,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-13 22:43:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 22:43:43,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:43,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5382428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:43,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:43,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 15 [2022-07-13 22:43:43,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361591026] [2022-07-13 22:43:43,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:43,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:43:43,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:43,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:43:43,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:43:43,347 INFO L87 Difference]: Start difference. First operand 173 states and 222 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 22:43:44,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:44,036 INFO L93 Difference]: Finished difference Result 419 states and 563 transitions. [2022-07-13 22:43:44,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 22:43:44,036 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 96 [2022-07-13 22:43:44,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:44,038 INFO L225 Difference]: With dead ends: 419 [2022-07-13 22:43:44,038 INFO L226 Difference]: Without dead ends: 285 [2022-07-13 22:43:44,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:43:44,039 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 265 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:44,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1289 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 507 Invalid, 0 Unknown, 103 Unchecked, 0.5s Time] [2022-07-13 22:43:44,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-13 22:43:44,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 192. [2022-07-13 22:43:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 135 states have (on average 1.162962962962963) internal successors, (157), 142 states have internal predecessors, (157), 37 states have call successors, (37), 13 states have call predecessors, (37), 19 states have return successors, (51), 36 states have call predecessors, (51), 36 states have call successors, (51) [2022-07-13 22:43:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 245 transitions. [2022-07-13 22:43:44,056 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 245 transitions. Word has length 96 [2022-07-13 22:43:44,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:44,057 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 245 transitions. [2022-07-13 22:43:44,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 22:43:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 245 transitions. [2022-07-13 22:43:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 22:43:44,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:44,059 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:43:44,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-13 22:43:44,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 22:43:44,280 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:44,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:44,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1793920484, now seen corresponding path program 1 times [2022-07-13 22:43:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:44,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653812589] [2022-07-13 22:43:44,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:44,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:43:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:43:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:43:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:43:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:43:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 22:43:44,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:44,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653812589] [2022-07-13 22:43:44,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653812589] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:44,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969767173] [2022-07-13 22:43:44,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:44,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:44,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:44,464 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:43:44,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 22:43:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 2673 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:43:44,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 22:43:44,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:44,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969767173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:44,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:44,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 22:43:44,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383523636] [2022-07-13 22:43:44,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:44,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:43:44,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:44,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:43:44,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:43:44,886 INFO L87 Difference]: Start difference. First operand 192 states and 245 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:43:44,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:44,913 INFO L93 Difference]: Finished difference Result 345 states and 444 transitions. [2022-07-13 22:43:44,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:43:44,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2022-07-13 22:43:44,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:44,915 INFO L225 Difference]: With dead ends: 345 [2022-07-13 22:43:44,915 INFO L226 Difference]: Without dead ends: 185 [2022-07-13 22:43:44,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:43:44,916 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 26 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:44,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 462 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:43:44,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-13 22:43:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2022-07-13 22:43:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 130 states have internal predecessors, (141), 37 states have call successors, (37), 13 states have call predecessors, (37), 18 states have return successors, (47), 36 states have call predecessors, (47), 36 states have call successors, (47) [2022-07-13 22:43:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2022-07-13 22:43:44,929 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 96 [2022-07-13 22:43:44,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:44,930 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2022-07-13 22:43:44,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:43:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2022-07-13 22:43:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 22:43:44,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:44,931 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:43:44,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 22:43:45,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:45,144 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:45,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:45,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1638074292, now seen corresponding path program 1 times [2022-07-13 22:43:45,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:45,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317145865] [2022-07-13 22:43:45,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:45,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:43:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:43:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 22:43:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:43:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:43:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 22:43:45,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:45,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317145865] [2022-07-13 22:43:45,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317145865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:45,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:45,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:43:45,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874770652] [2022-07-13 22:43:45,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:45,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:43:45,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:45,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:43:45,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:43:45,428 INFO L87 Difference]: Start difference. First operand 180 states and 225 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-13 22:43:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:45,984 INFO L93 Difference]: Finished difference Result 188 states and 233 transitions. [2022-07-13 22:43:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:43:45,985 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2022-07-13 22:43:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:45,986 INFO L225 Difference]: With dead ends: 188 [2022-07-13 22:43:45,986 INFO L226 Difference]: Without dead ends: 186 [2022-07-13 22:43:45,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:43:45,987 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 83 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:45,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 566 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:43:45,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-13 22:43:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2022-07-13 22:43:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 133 states have internal predecessors, (144), 38 states have call successors, (38), 14 states have call predecessors, (38), 19 states have return successors, (48), 37 states have call predecessors, (48), 37 states have call successors, (48) [2022-07-13 22:43:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 230 transitions. [2022-07-13 22:43:46,001 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 230 transitions. Word has length 100 [2022-07-13 22:43:46,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:46,001 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 230 transitions. [2022-07-13 22:43:46,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-13 22:43:46,001 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 230 transitions. [2022-07-13 22:43:46,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 22:43:46,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:46,003 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:43:46,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 22:43:46,003 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:46,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:46,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1497297622, now seen corresponding path program 1 times [2022-07-13 22:43:46,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:46,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926374742] [2022-07-13 22:43:46,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:46,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 22:43:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:43:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:43:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:43:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:43:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 22:43:46,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:46,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926374742] [2022-07-13 22:43:46,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926374742] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:46,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843508285] [2022-07-13 22:43:46,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:46,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:46,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:46,272 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:43:46,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 22:43:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 2678 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:43:46,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 22:43:46,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:46,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843508285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:46,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:46,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-07-13 22:43:46,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034148489] [2022-07-13 22:43:46,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:46,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:43:46,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:46,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:43:46,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:43:46,782 INFO L87 Difference]: Start difference. First operand 185 states and 230 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 22:43:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:46,895 INFO L93 Difference]: Finished difference Result 341 states and 425 transitions. [2022-07-13 22:43:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:43:46,896 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 100 [2022-07-13 22:43:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:46,897 INFO L225 Difference]: With dead ends: 341 [2022-07-13 22:43:46,897 INFO L226 Difference]: Without dead ends: 185 [2022-07-13 22:43:46,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:43:46,899 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:46,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1147 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:43:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-13 22:43:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2022-07-13 22:43:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 120 states have (on average 1.1416666666666666) internal successors, (137), 125 states have internal predecessors, (137), 38 states have call successors, (38), 14 states have call predecessors, (38), 18 states have return successors, (45), 37 states have call predecessors, (45), 37 states have call successors, (45) [2022-07-13 22:43:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 220 transitions. [2022-07-13 22:43:46,913 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 220 transitions. Word has length 100 [2022-07-13 22:43:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:46,913 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 220 transitions. [2022-07-13 22:43:46,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 22:43:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 220 transitions. [2022-07-13 22:43:46,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-13 22:43:46,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:46,915 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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, 1, 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:43:46,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 22:43:47,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:47,141 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1094528621, now seen corresponding path program 1 times [2022-07-13 22:43:47,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:47,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697920619] [2022-07-13 22:43:47,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:47,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:47,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:47,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:47,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:47,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:47,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:47,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:43:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:47,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:43:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:47,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:43:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:47,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:43:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:47,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:43:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 22:43:47,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:47,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697920619] [2022-07-13 22:43:47,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697920619] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:47,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338515897] [2022-07-13 22:43:47,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:47,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:47,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:47,543 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:43:47,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 22:43:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 2685 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-13 22:43:48,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:48,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-13 22:43:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 22:43:48,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:48,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338515897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:48,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:48,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 14 [2022-07-13 22:43:48,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187669909] [2022-07-13 22:43:48,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:48,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:43:48,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:48,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:43:48,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:43:48,215 INFO L87 Difference]: Start difference. First operand 177 states and 220 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-13 22:43:48,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:48,792 INFO L93 Difference]: Finished difference Result 410 states and 542 transitions. [2022-07-13 22:43:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:43:48,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 102 [2022-07-13 22:43:48,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:48,795 INFO L225 Difference]: With dead ends: 410 [2022-07-13 22:43:48,795 INFO L226 Difference]: Without dead ends: 279 [2022-07-13 22:43:48,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:43:48,796 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 101 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:48,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1324 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 431 Invalid, 0 Unknown, 77 Unchecked, 0.4s Time] [2022-07-13 22:43:48,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-13 22:43:48,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 183. [2022-07-13 22:43:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 125 states have (on average 1.136) internal successors, (142), 131 states have internal predecessors, (142), 38 states have call successors, (38), 14 states have call predecessors, (38), 19 states have return successors, (49), 37 states have call predecessors, (49), 37 states have call successors, (49) [2022-07-13 22:43:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 229 transitions. [2022-07-13 22:43:48,811 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 229 transitions. Word has length 102 [2022-07-13 22:43:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:48,812 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 229 transitions. [2022-07-13 22:43:48,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-13 22:43:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 229 transitions. [2022-07-13 22:43:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-13 22:43:48,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:48,814 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 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:43:48,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 22:43:49,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 22:43:49,027 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:49,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1040135723, now seen corresponding path program 1 times [2022-07-13 22:43:49,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:49,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088414992] [2022-07-13 22:43:49,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:49,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:43:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:43:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:43:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:43:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:43:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 22:43:49,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:49,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088414992] [2022-07-13 22:43:49,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088414992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:49,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:49,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-13 22:43:49,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418361721] [2022-07-13 22:43:49,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:49,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 22:43:49,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:49,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 22:43:49,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:43:49,608 INFO L87 Difference]: Start difference. First operand 183 states and 229 transitions. Second operand has 19 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 7 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-13 22:43:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:50,778 INFO L93 Difference]: Finished difference Result 310 states and 382 transitions. [2022-07-13 22:43:50,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 22:43:50,779 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 7 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 102 [2022-07-13 22:43:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:50,780 INFO L225 Difference]: With dead ends: 310 [2022-07-13 22:43:50,780 INFO L226 Difference]: Without dead ends: 183 [2022-07-13 22:43:50,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2022-07-13 22:43:50,781 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 123 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:50,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 659 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 22:43:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-13 22:43:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-07-13 22:43:50,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 125 states have (on average 1.136) internal successors, (142), 131 states have internal predecessors, (142), 38 states have call successors, (38), 14 states have call predecessors, (38), 19 states have return successors, (48), 37 states have call predecessors, (48), 37 states have call successors, (48) [2022-07-13 22:43:50,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 228 transitions. [2022-07-13 22:43:50,796 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 228 transitions. Word has length 102 [2022-07-13 22:43:50,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:50,797 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 228 transitions. [2022-07-13 22:43:50,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 7 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-13 22:43:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 228 transitions. [2022-07-13 22:43:50,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-13 22:43:50,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:50,800 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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, 1, 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:43:50,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 22:43:50,800 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:50,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:50,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1868628179, now seen corresponding path program 1 times [2022-07-13 22:43:50,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:50,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403484363] [2022-07-13 22:43:50,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:50,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:51,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:51,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:51,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:51,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:51,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:51,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:43:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:51,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:43:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:51,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:43:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:51,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:43:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:51,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:43:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 22:43:52,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:52,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403484363] [2022-07-13 22:43:52,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403484363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:52,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:52,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-13 22:43:52,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800030767] [2022-07-13 22:43:52,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:52,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 22:43:52,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:52,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 22:43:52,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:43:52,034 INFO L87 Difference]: Start difference. First operand 183 states and 228 transitions. Second operand has 21 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 17 states have internal predecessors, (71), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 22:43:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:53,708 INFO L93 Difference]: Finished difference Result 325 states and 400 transitions. [2022-07-13 22:43:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 22:43:53,709 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 17 states have internal predecessors, (71), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 102 [2022-07-13 22:43:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:53,710 INFO L225 Difference]: With dead ends: 325 [2022-07-13 22:43:53,710 INFO L226 Difference]: Without dead ends: 206 [2022-07-13 22:43:53,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=1597, Unknown=0, NotChecked=0, Total=1806 [2022-07-13 22:43:53,712 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 163 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:53,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 938 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 22:43:53,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-13 22:43:53,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 187. [2022-07-13 22:43:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 129 states have (on average 1.1395348837209303) internal successors, (147), 135 states have internal predecessors, (147), 38 states have call successors, (38), 14 states have call predecessors, (38), 19 states have return successors, (48), 37 states have call predecessors, (48), 37 states have call successors, (48) [2022-07-13 22:43:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 233 transitions. [2022-07-13 22:43:53,730 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 233 transitions. Word has length 102 [2022-07-13 22:43:53,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:53,735 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 233 transitions. [2022-07-13 22:43:53,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 17 states have internal predecessors, (71), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 22:43:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 233 transitions. [2022-07-13 22:43:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-13 22:43:53,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:53,737 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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, 1, 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:43:53,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 22:43:53,737 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:53,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:53,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1610462741, now seen corresponding path program 1 times [2022-07-13 22:43:53,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:53,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982421468] [2022-07-13 22:43:53,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:53,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:53,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:53,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:53,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:53,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:53,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:53,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:43:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:53,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:43:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:43:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:53,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:43:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:53,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:43:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-13 22:43:53,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:53,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982421468] [2022-07-13 22:43:53,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982421468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:53,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:53,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:43:53,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372128479] [2022-07-13 22:43:53,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:53,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:43:53,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:53,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:43:53,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:43:53,993 INFO L87 Difference]: Start difference. First operand 187 states and 233 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 22:43:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:54,272 INFO L93 Difference]: Finished difference Result 308 states and 379 transitions. [2022-07-13 22:43:54,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:43:54,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 102 [2022-07-13 22:43:54,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:54,274 INFO L225 Difference]: With dead ends: 308 [2022-07-13 22:43:54,274 INFO L226 Difference]: Without dead ends: 185 [2022-07-13 22:43:54,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:43:54,275 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 68 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:54,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 297 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:43:54,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-13 22:43:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-07-13 22:43:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 127 states have (on average 1.125984251968504) internal successors, (143), 133 states have internal predecessors, (143), 38 states have call successors, (38), 14 states have call predecessors, (38), 19 states have return successors, (48), 37 states have call predecessors, (48), 37 states have call successors, (48) [2022-07-13 22:43:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 229 transitions. [2022-07-13 22:43:54,289 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 229 transitions. Word has length 102 [2022-07-13 22:43:54,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:54,289 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 229 transitions. [2022-07-13 22:43:54,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 22:43:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 229 transitions. [2022-07-13 22:43:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-13 22:43:54,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:54,291 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:43:54,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 22:43:54,291 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:54,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:54,292 INFO L85 PathProgramCache]: Analyzing trace with hash -63505454, now seen corresponding path program 1 times [2022-07-13 22:43:54,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:54,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684660702] [2022-07-13 22:43:54,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:43:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:43:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 22:43:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:43:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:43:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 22:43:54,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:54,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684660702] [2022-07-13 22:43:54,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684660702] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:54,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657400384] [2022-07-13 22:43:54,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:54,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:54,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:54,930 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:43:54,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 22:43:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:55,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 2682 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-13 22:43:55,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:55,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 22:43:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 22:43:55,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:55,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657400384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:55,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:55,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 21 [2022-07-13 22:43:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018447092] [2022-07-13 22:43:55,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:55,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 22:43:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:55,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 22:43:55,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:43:55,625 INFO L87 Difference]: Start difference. First operand 185 states and 229 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-13 22:43:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:55,747 INFO L93 Difference]: Finished difference Result 341 states and 413 transitions. [2022-07-13 22:43:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:43:55,748 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 104 [2022-07-13 22:43:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:55,750 INFO L225 Difference]: With dead ends: 341 [2022-07-13 22:43:55,750 INFO L226 Difference]: Without dead ends: 192 [2022-07-13 22:43:55,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:43:55,755 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 80 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:55,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 642 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 64 Invalid, 0 Unknown, 75 Unchecked, 0.1s Time] [2022-07-13 22:43:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-13 22:43:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2022-07-13 22:43:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 130 states have (on average 1.123076923076923) internal successors, (146), 135 states have internal predecessors, (146), 38 states have call successors, (38), 15 states have call predecessors, (38), 19 states have return successors, (47), 37 states have call predecessors, (47), 37 states have call successors, (47) [2022-07-13 22:43:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 231 transitions. [2022-07-13 22:43:55,777 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 231 transitions. Word has length 104 [2022-07-13 22:43:55,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:55,779 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 231 transitions. [2022-07-13 22:43:55,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-13 22:43:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 231 transitions. [2022-07-13 22:43:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-13 22:43:55,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:55,781 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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, 1, 1, 1, 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:43:55,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 22:43:55,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:55,995 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:55,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:55,996 INFO L85 PathProgramCache]: Analyzing trace with hash -335461550, now seen corresponding path program 1 times [2022-07-13 22:43:55,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:55,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329032371] [2022-07-13 22:43:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:55,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:56,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:56,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:56,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:56,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:56,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:56,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:43:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:43:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:56,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:43:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:56,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:43:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:56,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:43:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-13 22:43:56,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:56,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329032371] [2022-07-13 22:43:56,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329032371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:56,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:56,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 22:43:56,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198304877] [2022-07-13 22:43:56,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:56,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:43:56,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:56,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:43:56,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:43:56,259 INFO L87 Difference]: Start difference. First operand 188 states and 231 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 22:43:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:56,816 INFO L93 Difference]: Finished difference Result 202 states and 246 transitions. [2022-07-13 22:43:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:43:56,818 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 104 [2022-07-13 22:43:56,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:56,820 INFO L225 Difference]: With dead ends: 202 [2022-07-13 22:43:56,820 INFO L226 Difference]: Without dead ends: 200 [2022-07-13 22:43:56,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:43:56,821 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 81 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:56,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 705 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:43:56,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-13 22:43:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2022-07-13 22:43:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 138 states have (on average 1.1159420289855073) internal successors, (154), 144 states have internal predecessors, (154), 39 states have call successors, (39), 16 states have call predecessors, (39), 21 states have return successors, (50), 38 states have call predecessors, (50), 38 states have call successors, (50) [2022-07-13 22:43:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 243 transitions. [2022-07-13 22:43:56,836 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 243 transitions. Word has length 104 [2022-07-13 22:43:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:56,836 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 243 transitions. [2022-07-13 22:43:56,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 22:43:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 243 transitions. [2022-07-13 22:43:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-13 22:43:56,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:56,838 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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, 1, 1, 1, 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:43:56,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 22:43:56,839 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:56,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:56,839 INFO L85 PathProgramCache]: Analyzing trace with hash 365603028, now seen corresponding path program 1 times [2022-07-13 22:43:56,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:56,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467573173] [2022-07-13 22:43:56,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:56,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:56,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:56,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:57,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:57,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:57,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:57,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:43:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:57,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:43:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:57,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:43:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:57,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:43:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:57,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:43:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-13 22:43:57,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:57,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467573173] [2022-07-13 22:43:57,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467573173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:57,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:57,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 22:43:57,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301344944] [2022-07-13 22:43:57,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:57,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:43:57,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:57,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:43:57,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:43:57,149 INFO L87 Difference]: Start difference. First operand 199 states and 243 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 22:43:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:57,936 INFO L93 Difference]: Finished difference Result 206 states and 249 transitions. [2022-07-13 22:43:57,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 22:43:57,937 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 104 [2022-07-13 22:43:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:57,938 INFO L225 Difference]: With dead ends: 206 [2022-07-13 22:43:57,938 INFO L226 Difference]: Without dead ends: 204 [2022-07-13 22:43:57,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:43:57,939 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 95 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:57,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 812 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 22:43:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-13 22:43:57,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2022-07-13 22:43:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 133 states have (on average 1.1203007518796992) internal successors, (149), 138 states have internal predecessors, (149), 38 states have call successors, (38), 16 states have call predecessors, (38), 20 states have return successors, (47), 37 states have call predecessors, (47), 37 states have call successors, (47) [2022-07-13 22:43:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 234 transitions. [2022-07-13 22:43:57,954 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 234 transitions. Word has length 104 [2022-07-13 22:43:57,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:57,954 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 234 transitions. [2022-07-13 22:43:57,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 22:43:57,955 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 234 transitions. [2022-07-13 22:43:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 22:43:57,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:57,956 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:57,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 22:43:57,956 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:57,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:57,957 INFO L85 PathProgramCache]: Analyzing trace with hash 116279649, now seen corresponding path program 1 times [2022-07-13 22:43:57,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:57,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74242891] [2022-07-13 22:43:57,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:57,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:43:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:43:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:43:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 22:43:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:43:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:43:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:43:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,456 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 22:43:58,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:58,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74242891] [2022-07-13 22:43:58,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74242891] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:58,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947557813] [2022-07-13 22:43:58,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:58,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:58,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:58,460 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:43:58,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 22:43:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 2691 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-13 22:43:58,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:59,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 22:43:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 22:43:59,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:43:59,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2022-07-13 22:43:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 22:43:59,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947557813] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:43:59,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:43:59,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 13] total 29 [2022-07-13 22:43:59,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157519744] [2022-07-13 22:43:59,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:43:59,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-13 22:43:59,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:59,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-13 22:43:59,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2022-07-13 22:43:59,704 INFO L87 Difference]: Start difference. First operand 192 states and 234 transitions. Second operand has 29 states, 27 states have (on average 4.814814814814815) internal successors, (130), 22 states have internal predecessors, (130), 12 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) [2022-07-13 22:44:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:00,881 INFO L93 Difference]: Finished difference Result 351 states and 417 transitions. [2022-07-13 22:44:00,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 22:44:00,882 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 4.814814814814815) internal successors, (130), 22 states have internal predecessors, (130), 12 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) Word has length 110 [2022-07-13 22:44:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:00,883 INFO L225 Difference]: With dead ends: 351 [2022-07-13 22:44:00,883 INFO L226 Difference]: Without dead ends: 220 [2022-07-13 22:44:00,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 227 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=1433, Unknown=0, NotChecked=0, Total=1640 [2022-07-13 22:44:00,885 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 337 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:00,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 900 Invalid, 1821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1472 Invalid, 0 Unknown, 210 Unchecked, 0.9s Time] [2022-07-13 22:44:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-13 22:44:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2022-07-13 22:44:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 154 states have (on average 1.1103896103896105) internal successors, (171), 161 states have internal predecessors, (171), 38 states have call successors, (38), 17 states have call predecessors, (38), 23 states have return successors, (46), 37 states have call predecessors, (46), 37 states have call successors, (46) [2022-07-13 22:44:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 255 transitions. [2022-07-13 22:44:00,900 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 255 transitions. Word has length 110 [2022-07-13 22:44:00,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:00,900 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 255 transitions. [2022-07-13 22:44:00,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 4.814814814814815) internal successors, (130), 22 states have internal predecessors, (130), 12 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) [2022-07-13 22:44:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 255 transitions. [2022-07-13 22:44:00,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-13 22:44:00,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:00,902 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 22:44:00,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 22:44:01,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-13 22:44:01,116 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:01,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:01,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1502069968, now seen corresponding path program 1 times [2022-07-13 22:44:01,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:01,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734769470] [2022-07-13 22:44:01,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:01,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:44:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:44:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:44:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:44:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:44:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:44:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:44:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:44:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:44:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:44:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 16 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 22:44:01,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:01,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734769470] [2022-07-13 22:44:01,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734769470] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:44:01,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244437731] [2022-07-13 22:44:01,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:01,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:44:01,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:44:01,963 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:44:01,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 22:44:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:02,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 2700 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-13 22:44:02,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:44:02,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:44:02,626 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 22:44:02,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 22:44:02,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:44:02,851 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 22:44:02,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-13 22:44:02,934 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-13 22:44:02,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-13 22:44:09,428 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:44:09,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2022-07-13 22:44:09,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 22:44:09,506 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:44:09,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2022-07-13 22:44:09,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 22:44:09,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:44:09,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-13 22:44:09,590 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-13 22:44:09,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 22:44:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:44:16,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:44:16,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244437731] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:44:16,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:44:16,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26] total 40 [2022-07-13 22:44:16,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244772500] [2022-07-13 22:44:16,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:44:16,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-13 22:44:16,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:16,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-13 22:44:16,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1786, Unknown=11, NotChecked=0, Total=1980 [2022-07-13 22:44:16,411 INFO L87 Difference]: Start difference. First operand 216 states and 255 transitions. Second operand has 40 states, 37 states have (on average 4.027027027027027) internal successors, (149), 35 states have internal predecessors, (149), 14 states have call successors, (24), 9 states have call predecessors, (24), 11 states have return successors, (23), 10 states have call predecessors, (23), 13 states have call successors, (23) [2022-07-13 22:44:31,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:31,267 INFO L93 Difference]: Finished difference Result 383 states and 465 transitions. [2022-07-13 22:44:31,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-13 22:44:31,268 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 4.027027027027027) internal successors, (149), 35 states have internal predecessors, (149), 14 states have call successors, (24), 9 states have call predecessors, (24), 11 states have return successors, (23), 10 states have call predecessors, (23), 13 states have call successors, (23) Word has length 116 [2022-07-13 22:44:31,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:31,270 INFO L225 Difference]: With dead ends: 383 [2022-07-13 22:44:31,270 INFO L226 Difference]: Without dead ends: 291 [2022-07-13 22:44:31,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 140 SyntacticMatches, 9 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=542, Invalid=4696, Unknown=18, NotChecked=0, Total=5256 [2022-07-13 22:44:31,272 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 491 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1402 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:31,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 833 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1287 Invalid, 0 Unknown, 1402 Unchecked, 1.0s Time] [2022-07-13 22:44:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-07-13 22:44:31,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 247. [2022-07-13 22:44:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 175 states have (on average 1.0971428571428572) internal successors, (192), 183 states have internal predecessors, (192), 44 states have call successors, (44), 21 states have call predecessors, (44), 27 states have return successors, (56), 42 states have call predecessors, (56), 43 states have call successors, (56) [2022-07-13 22:44:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 292 transitions. [2022-07-13 22:44:31,295 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 292 transitions. Word has length 116 [2022-07-13 22:44:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:31,295 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 292 transitions. [2022-07-13 22:44:31,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 4.027027027027027) internal successors, (149), 35 states have internal predecessors, (149), 14 states have call successors, (24), 9 states have call predecessors, (24), 11 states have return successors, (23), 10 states have call predecessors, (23), 13 states have call successors, (23) [2022-07-13 22:44:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 292 transitions. [2022-07-13 22:44:31,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-13 22:44:31,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:31,298 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:44:31,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 22:44:31,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-13 22:44:31,523 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:31,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:31,524 INFO L85 PathProgramCache]: Analyzing trace with hash -333479690, now seen corresponding path program 1 times [2022-07-13 22:44:31,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:31,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614689125] [2022-07-13 22:44:31,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:31,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:31,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:44:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:31,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:44:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:31,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:44:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:31,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:31,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:44:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:31,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:44:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:31,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:44:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:31,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:31,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:44:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:31,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:44:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:32,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:44:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:32,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:44:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 22:44:32,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:32,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614689125] [2022-07-13 22:44:32,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614689125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:44:32,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:44:32,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-13 22:44:32,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972589561] [2022-07-13 22:44:32,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:44:32,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 22:44:32,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:32,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 22:44:32,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:44:32,154 INFO L87 Difference]: Start difference. First operand 247 states and 292 transitions. Second operand has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 16 states have internal predecessors, (66), 7 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-13 22:44:33,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:33,664 INFO L93 Difference]: Finished difference Result 355 states and 439 transitions. [2022-07-13 22:44:33,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 22:44:33,664 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 16 states have internal predecessors, (66), 7 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 116 [2022-07-13 22:44:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:33,666 INFO L225 Difference]: With dead ends: 355 [2022-07-13 22:44:33,666 INFO L226 Difference]: Without dead ends: 286 [2022-07-13 22:44:33,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2022-07-13 22:44:33,667 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 215 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:33,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 521 Invalid, 2082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 22:44:33,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-13 22:44:33,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 257. [2022-07-13 22:44:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 182 states have (on average 1.0934065934065933) internal successors, (199), 191 states have internal predecessors, (199), 45 states have call successors, (45), 21 states have call predecessors, (45), 29 states have return successors, (63), 44 states have call predecessors, (63), 44 states have call successors, (63) [2022-07-13 22:44:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 307 transitions. [2022-07-13 22:44:33,689 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 307 transitions. Word has length 116 [2022-07-13 22:44:33,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:33,690 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 307 transitions. [2022-07-13 22:44:33,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 16 states have internal predecessors, (66), 7 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-13 22:44:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 307 transitions. [2022-07-13 22:44:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-13 22:44:33,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:33,691 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:44:33,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 22:44:33,692 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:33,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:33,692 INFO L85 PathProgramCache]: Analyzing trace with hash -75314252, now seen corresponding path program 1 times [2022-07-13 22:44:33,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:33,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240347970] [2022-07-13 22:44:33,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:33,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:33,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:44:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:33,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:44:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:33,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:44:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:33,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:33,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:44:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:33,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:44:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:33,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:44:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:33,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:33,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:44:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:33,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:44:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:33,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:44:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:33,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:44:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-13 22:44:33,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:33,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240347970] [2022-07-13 22:44:33,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240347970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:44:33,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:44:33,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:44:33,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943611793] [2022-07-13 22:44:33,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:44:33,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:44:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:33,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:44:33,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:44:33,937 INFO L87 Difference]: Start difference. First operand 257 states and 307 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-13 22:44:34,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:34,376 INFO L93 Difference]: Finished difference Result 326 states and 391 transitions. [2022-07-13 22:44:34,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:44:34,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2022-07-13 22:44:34,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:34,382 INFO L225 Difference]: With dead ends: 326 [2022-07-13 22:44:34,382 INFO L226 Difference]: Without dead ends: 250 [2022-07-13 22:44:34,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:44:34,383 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 81 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:34,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 351 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:44:34,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-13 22:44:34,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-07-13 22:44:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 176 states have (on average 1.0909090909090908) internal successors, (192), 184 states have internal predecessors, (192), 45 states have call successors, (45), 21 states have call predecessors, (45), 28 states have return successors, (60), 44 states have call predecessors, (60), 44 states have call successors, (60) [2022-07-13 22:44:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 297 transitions. [2022-07-13 22:44:34,411 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 297 transitions. Word has length 116 [2022-07-13 22:44:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:34,412 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 297 transitions. [2022-07-13 22:44:34,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-13 22:44:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 297 transitions. [2022-07-13 22:44:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-13 22:44:34,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:34,413 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:34,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 22:44:34,414 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:34,414 INFO L85 PathProgramCache]: Analyzing trace with hash -663036306, now seen corresponding path program 1 times [2022-07-13 22:44:34,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:34,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297084587] [2022-07-13 22:44:34,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:34,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:34,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:44:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:34,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:44:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:34,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:44:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:34,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:34,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:44:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:34,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:44:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:34,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:44:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:34,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:34,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:44:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:34,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:44:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:34,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:44:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:34,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:44:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 22:44:34,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:34,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297084587] [2022-07-13 22:44:34,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297084587] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:44:34,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157119497] [2022-07-13 22:44:34,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:34,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:44:34,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:44:34,944 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:44:34,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 22:44:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:35,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 2705 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-13 22:44:35,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:44:35,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:44:36,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-13 22:44:36,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-13 22:44:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 22:44:36,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:44:36,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157119497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:44:36,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:44:36,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 27 [2022-07-13 22:44:36,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513575881] [2022-07-13 22:44:36,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:44:36,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 22:44:36,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:36,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 22:44:36,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2022-07-13 22:44:36,223 INFO L87 Difference]: Start difference. First operand 250 states and 297 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 11 states have internal predecessors, (77), 6 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-13 22:44:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:36,771 INFO L93 Difference]: Finished difference Result 404 states and 485 transitions. [2022-07-13 22:44:36,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 22:44:36,772 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 11 states have internal predecessors, (77), 6 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 116 [2022-07-13 22:44:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:36,773 INFO L225 Difference]: With dead ends: 404 [2022-07-13 22:44:36,773 INFO L226 Difference]: Without dead ends: 267 [2022-07-13 22:44:36,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2022-07-13 22:44:36,774 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 217 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 561 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:36,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 660 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 509 Invalid, 0 Unknown, 561 Unchecked, 0.4s Time] [2022-07-13 22:44:36,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-13 22:44:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 239. [2022-07-13 22:44:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 171 states have (on average 1.087719298245614) internal successors, (186), 178 states have internal predecessors, (186), 40 states have call successors, (40), 20 states have call predecessors, (40), 27 states have return successors, (54), 40 states have call predecessors, (54), 39 states have call successors, (54) [2022-07-13 22:44:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 280 transitions. [2022-07-13 22:44:36,795 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 280 transitions. Word has length 116 [2022-07-13 22:44:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:36,795 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 280 transitions. [2022-07-13 22:44:36,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 11 states have internal predecessors, (77), 6 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-13 22:44:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 280 transitions. [2022-07-13 22:44:36,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 22:44:36,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:36,797 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:36,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 22:44:37,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-13 22:44:37,023 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:37,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:37,024 INFO L85 PathProgramCache]: Analyzing trace with hash 286245061, now seen corresponding path program 1 times [2022-07-13 22:44:37,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:37,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299696208] [2022-07-13 22:44:37,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:37,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:37,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:44:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:37,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:44:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:37,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:44:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:37,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:37,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:44:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:37,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:44:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:37,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:44:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:37,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:44:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:37,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:37,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 22:44:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:37,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:44:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:37,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:44:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:37,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:44:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:37,665 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-13 22:44:37,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:37,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299696208] [2022-07-13 22:44:37,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299696208] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:44:37,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350019601] [2022-07-13 22:44:37,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:37,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:44:37,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:44:37,672 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:44:37,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 22:44:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:38,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 2741 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-13 22:44:38,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:44:38,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:44:40,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:44:40,811 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-13 22:44:40,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-07-13 22:44:43,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:44:43,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:44:43,051 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:44:43,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 47 [2022-07-13 22:44:52,792 INFO L356 Elim1Store]: treesize reduction 197, result has 31.4 percent of original size [2022-07-13 22:44:52,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 155 [2022-07-13 22:44:54,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-07-13 22:44:55,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-07-13 22:44:55,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-07-13 22:44:55,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-07-13 22:44:55,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-07-13 22:44:55,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-07-13 22:44:55,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-13 22:44:55,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-13 22:44:55,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-07-13 22:44:56,842 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15| Int)) (let ((.cse0 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|))) (= (select .cse0 (- 16)) (select .cse0 0)))) (exists ((|v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| Int) (aux_div_v_arrayElimCell_27_45 Int)) (let ((.cse1 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1|))) (and (= (* aux_div_v_arrayElimCell_27_45 18446744073709551616) (select .cse1 24)) (= (select .cse1 8) (select .cse1 0))))) (exists ((|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15| Int)) (let ((.cse2 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|))) (= (select .cse2 (- 8)) (select .cse2 0)))) (exists ((|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15| Int) (|v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| Int) (aux_div_v_arrayElimCell_27_45 Int)) (let ((.cse3 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|))) (and (not (= |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|)) (= (select (select |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1|) 0) (select .cse3 8)) (= (select .cse3 24) (* aux_div_v_arrayElimCell_27_45 18446744073709551616))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15| Int) (|v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| Int) (aux_div_v_arrayElimCell_27_45 Int)) (let ((.cse4 (* aux_div_v_arrayElimCell_27_45 18446744073709551616)) (.cse5 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|)) (.cse7 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1|)) (.cse6 (select v_DerPreprocessor_1 8))) (and (= .cse4 (select .cse5 16)) (= (select v_DerPreprocessor_1 0) .cse6) (= .cse4 (select (select (store |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| v_DerPreprocessor_1) |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|) 16)) (= (select .cse7 0) (select .cse5 0)) (= (select .cse7 8) .cse6)))) (exists ((|v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15| Int) (|v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| Int) (aux_div_v_arrayElimCell_27_45 Int)) (let ((.cse14 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1|))) (let ((.cse9 (* aux_div_v_arrayElimCell_27_45 18446744073709551616)) (.cse12 (select (store |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| v_DerPreprocessor_3) |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|)) (.cse11 (+ 16 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_15|)) (.cse13 (select .cse14 0)) (.cse10 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|)) (.cse8 (select v_DerPreprocessor_3 8))) (and (= (select v_DerPreprocessor_3 0) .cse8) (or (= .cse9 (select .cse10 .cse11)) (= .cse11 0)) (= (select .cse12 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_15|) .cse13) (not (= 8 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_15|)) (= .cse9 (select .cse12 .cse11)) (= .cse13 (select .cse10 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_15|)) (= (select .cse14 8) .cse8)))))) is different from true [2022-07-13 22:45:17,747 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15| Int)) (let ((.cse0 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|))) (= (select .cse0 (- 16)) (select .cse0 0)))) (exists ((|v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| Int) (aux_div_v_arrayElimCell_27_45 Int)) (let ((.cse1 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1|))) (and (= (* aux_div_v_arrayElimCell_27_45 18446744073709551616) (select .cse1 24)) (= (select .cse1 8) (select .cse1 0))))) (exists ((|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15| Int)) (let ((.cse2 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|))) (= (select .cse2 (- 8)) (select .cse2 0)))) (exists ((|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15| Int) (|v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| Int) (aux_div_v_arrayElimCell_27_45 Int)) (let ((.cse3 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|))) (and (not (= |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|)) (= (select (select |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1|) 0) (select .cse3 8)) (= (select .cse3 24) (* aux_div_v_arrayElimCell_27_45 18446744073709551616))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15| Int) (|v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| Int) (aux_div_v_arrayElimCell_27_45 Int)) (let ((.cse4 (* aux_div_v_arrayElimCell_27_45 18446744073709551616)) (.cse5 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|)) (.cse7 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1|)) (.cse6 (select v_DerPreprocessor_1 8))) (and (= .cse4 (select .cse5 16)) (= (select v_DerPreprocessor_1 0) .cse6) (= .cse4 (select (select (store |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| v_DerPreprocessor_1) |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|) 16)) (= (select .cse7 0) (select .cse5 0)) (= (select .cse7 8) .cse6)))) (exists ((|v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15| Int) (|v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| Int) (aux_div_v_arrayElimCell_27_45 Int)) (let ((.cse14 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1|))) (let ((.cse9 (* aux_div_v_arrayElimCell_27_45 18446744073709551616)) (.cse12 (select (store |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| v_DerPreprocessor_3) |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|)) (.cse11 (+ 16 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_15|)) (.cse13 (select .cse14 0)) (.cse10 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|)) (.cse8 (select v_DerPreprocessor_3 8))) (and (= (select v_DerPreprocessor_3 0) .cse8) (or (= .cse9 (select .cse10 .cse11)) (= .cse11 0)) (= (select .cse12 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_15|) .cse13) (not (= 8 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_15|)) (= .cse9 (select .cse12 .cse11)) (= .cse13 (select .cse10 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_15|)) (= (select .cse14 8) .cse8)))))) (exists ((v_ArrVal_2409 Int) (|aws_byte_cursor_from_buf_~#cur~0.base| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |aws_byte_cursor_from_buf_~#cur~0.base| (let ((.cse15 (store (select |c_old(#memory_int)| |aws_byte_cursor_from_buf_~#cur~0.base|) 8 v_ArrVal_2409))) (store .cse15 0 (select (select (store |c_old(#memory_int)| |aws_byte_cursor_from_buf_~#cur~0.base| .cse15) |c_aws_byte_cursor_from_buf_#in~buf.base|) |c_aws_byte_cursor_from_buf_#in~buf.offset|))))) (= (mod (select (select |c_#memory_int| |aws_byte_cursor_from_buf_~#cur~0.base|) 0) 18446744073709551616) 0))) (= (mod (select (select |c_old(#memory_int)| |c_aws_byte_cursor_from_buf_#in~buf.base|) (+ |c_aws_byte_cursor_from_buf_#in~buf.offset| 16)) 18446744073709551616) 0)) is different from true [2022-07-13 22:45:18,056 INFO L356 Elim1Store]: treesize reduction 197, result has 31.4 percent of original size [2022-07-13 22:45:18,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 155 [2022-07-13 22:45:20,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2022-07-13 22:45:20,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-07-13 22:45:20,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-13 22:45:20,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-13 22:45:22,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-07-13 22:45:22,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-07-13 22:45:23,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-07-13 22:45:26,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-07-13 22:45:26,255 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15| Int)) (let ((.cse0 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|))) (= (select .cse0 (- 16)) (select .cse0 0)))) (exists ((|v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| Int) (aux_div_v_arrayElimCell_27_45 Int)) (let ((.cse1 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1|))) (and (= (* aux_div_v_arrayElimCell_27_45 18446744073709551616) (select .cse1 24)) (= (select .cse1 8) (select .cse1 0))))) (exists ((|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15| Int)) (let ((.cse2 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|))) (= (select .cse2 (- 8)) (select .cse2 0)))) (exists ((|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15| Int) (|v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| Int) (aux_div_v_arrayElimCell_27_45 Int)) (let ((.cse3 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|))) (and (not (= |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|)) (= (select (select |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1|) 0) (select .cse3 8)) (= (select .cse3 24) (* aux_div_v_arrayElimCell_27_45 18446744073709551616))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15| Int) (|v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| Int) (aux_div_v_arrayElimCell_27_45 Int)) (let ((.cse4 (* aux_div_v_arrayElimCell_27_45 18446744073709551616)) (.cse5 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|)) (.cse7 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1|)) (.cse6 (select v_DerPreprocessor_1 8))) (and (= .cse4 (select .cse5 16)) (= (select v_DerPreprocessor_1 0) .cse6) (= .cse4 (select (select (store |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| v_DerPreprocessor_1) |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|) 16)) (= (select .cse7 0) (select .cse5 0)) (= (select .cse7 8) .cse6)))) (exists ((|v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15| Int) (|v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| Int) (aux_div_v_arrayElimCell_27_45 Int)) (let ((.cse14 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1|))) (let ((.cse9 (* aux_div_v_arrayElimCell_27_45 18446744073709551616)) (.cse12 (select (store |c_#memory_int| |v_aws_byte_cursor_from_buf_~#cur~0.base_BEFORE_CALL_1| v_DerPreprocessor_3) |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|)) (.cse11 (+ 16 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_15|)) (.cse13 (select .cse14 0)) (.cse10 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_15|)) (.cse8 (select v_DerPreprocessor_3 8))) (and (= (select v_DerPreprocessor_3 0) .cse8) (or (= .cse9 (select .cse10 .cse11)) (= .cse11 0)) (= (select .cse12 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_15|) .cse13) (not (= 8 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_15|)) (= .cse9 (select .cse12 .cse11)) (= .cse13 (select .cse10 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_15|)) (= (select .cse14 8) .cse8)))))) (exists ((|aws_byte_cursor_from_buf_~#cur~0.base| Int)) (let ((.cse16 (select |c_#memory_int| |aws_byte_cursor_from_buf_~#cur~0.base|))) (let ((.cse17 (select .cse16 0))) (and (or (exists ((|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_16| Int) (aux_div_v_arrayElimCell_52_45 Int)) (let ((.cse15 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_16|))) (and (= (select .cse15 (- 8)) (select (select |c_#memory_int| |aws_byte_cursor_from_buf_~#cur~0.base|) 0)) (= (* aux_div_v_arrayElimCell_52_45 18446744073709551616) (select .cse15 8))))) (and (exists ((aux_div_v_arrayElimCell_52_45 Int)) (= (* aux_div_v_arrayElimCell_52_45 18446744073709551616) (select (select |c_#memory_int| |aws_byte_cursor_from_buf_~#cur~0.base|) 24))) (= (select .cse16 8) .cse17)) (exists ((|v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_16| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_16| Int) (aux_div_v_arrayElimCell_52_45 Int)) (let ((.cse24 (select |c_#memory_int| |aws_byte_cursor_from_buf_~#cur~0.base|))) (let ((.cse19 (select .cse24 0)) (.cse21 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_16|)) (.cse22 (* aux_div_v_arrayElimCell_52_45 18446744073709551616)) (.cse18 (select (store |c_#memory_int| |aws_byte_cursor_from_buf_~#cur~0.base| v_DerPreprocessor_7) |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_16|)) (.cse23 (+ 16 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_16|)) (.cse20 (select v_DerPreprocessor_7 0))) (and (or (= |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_16| 0) (= (select .cse18 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_16|) .cse19)) (or (not (= |aws_byte_cursor_from_buf_~#cur~0.base| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_16|)) (not (= 8 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_16|))) (= (select v_DerPreprocessor_7 8) .cse20) (= (select .cse21 |v_aws_byte_cursor_from_buf_#in~buf.offset_BEFORE_CALL_16|) .cse19) (= .cse22 (select .cse21 .cse23)) (= .cse22 (select .cse18 .cse23)) (= .cse20 (select .cse24 8)))))) (= (select .cse16 (- 16)) .cse17) (= (select .cse16 (- 8)) .cse17) (exists ((|v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_16| Int) (aux_div_v_arrayElimCell_52_45 Int)) (let ((.cse25 (select |c_#memory_int| |v_aws_byte_cursor_from_buf_#in~buf.base_BEFORE_CALL_16|))) (and (= (select .cse25 (- 16)) (select (select |c_#memory_int| |aws_byte_cursor_from_buf_~#cur~0.base|) 0)) (= (* aux_div_v_arrayElimCell_52_45 18446744073709551616) (select .cse25 0)))))) (= (mod .cse17 18446744073709551616) 0)))))) is different from true [2022-07-13 22:45:46,429 WARN L233 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 154 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:45:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 22:45:53,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:45:55,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350019601] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:45:55,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:45:55,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 30] total 45 [2022-07-13 22:45:55,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771623893] [2022-07-13 22:45:55,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:45:55,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-13 22:45:55,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:45:55,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-13 22:45:55,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1657, Unknown=25, NotChecked=252, Total=2070 [2022-07-13 22:45:55,238 INFO L87 Difference]: Start difference. First operand 239 states and 280 transitions. Second operand has 45 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 36 states have internal predecessors, (143), 19 states have call successors, (26), 10 states have call predecessors, (26), 13 states have return successors, (26), 15 states have call predecessors, (26), 19 states have call successors, (26)