./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_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 60926facf5511174d61dcd6a0b7a731efc9ccdb495bc26b58400da4cd6320ca0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:00:40,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:00:40,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:00:40,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:00:40,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:00:40,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:00:40,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:00:40,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:00:40,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:00:40,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:00:40,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:00:40,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:00:40,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:00:40,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:00:40,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:00:40,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:00:40,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:00:40,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:00:40,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:00:40,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:00:40,814 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:00:40,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:00:40,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:00:40,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:00:40,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:00:40,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:00:40,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:00:40,823 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:00:40,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:00:40,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:00:40,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:00:40,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:00:40,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:00:40,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:00:40,827 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:00:40,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:00:40,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:00:40,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:00:40,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:00:40,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:00:40,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:00:40,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:00:40,831 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:00:40,853 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:00:40,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:00:40,853 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:00:40,853 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:00:40,854 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:00:40,854 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:00:40,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:00:40,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:00:40,855 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:00:40,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:00:40,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:00:40,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:00:40,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:00:40,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:00:40,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:00:40,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:00:40,856 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:00:40,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:00:40,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:00:40,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:00:40,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:00:40,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:00:40,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:00:40,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:00:40,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:00:40,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:00:40,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:00:40,859 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:00:40,859 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:00:40,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:00:40,859 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 -> 60926facf5511174d61dcd6a0b7a731efc9ccdb495bc26b58400da4cd6320ca0 [2022-07-12 11:00:41,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:00:41,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:00:41,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:00:41,076 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:00:41,076 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:00:41,077 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_compare_lexical_harness.i [2022-07-12 11:00:41,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81fd9f29c/5699c78a1fd846f2a6b67e3edc1a35aa/FLAG6f98865fa [2022-07-12 11:00:41,664 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:00:41,666 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i [2022-07-12 11:00:41,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81fd9f29c/5699c78a1fd846f2a6b67e3edc1a35aa/FLAG6f98865fa [2022-07-12 11:00:42,165 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81fd9f29c/5699c78a1fd846f2a6b67e3edc1a35aa [2022-07-12 11:00:42,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:00:42,168 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:00:42,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:00:42,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:00:42,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:00:42,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:00:42" (1/1) ... [2022-07-12 11:00:42,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa0e23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:42, skipping insertion in model container [2022-07-12 11:00:42,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:00:42" (1/1) ... [2022-07-12 11:00:42,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:00:42,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:00:42,507 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_compare_lexical_harness.i[4505,4518] [2022-07-12 11:00:42,513 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_compare_lexical_harness.i[4565,4578] [2022-07-12 11:00:42,982 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:42,984 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:42,986 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:42,986 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:42,988 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,000 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,001 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,002 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,003 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,195 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:00:43,196 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:00:43,196 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:00:43,197 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:00:43,197 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:00:43,198 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:00:43,198 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:00:43,199 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:00:43,199 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:00:43,199 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:00:43,295 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:00:43,401 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,402 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:00:43,457 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:00:43,466 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_compare_lexical_harness.i[4505,4518] [2022-07-12 11:00:43,468 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_compare_lexical_harness.i[4565,4578] [2022-07-12 11:00:43,488 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,489 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,489 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,489 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,489 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,492 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,493 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,493 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,493 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,508 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:00:43,509 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:00:43,509 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:00:43,510 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:00:43,510 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:00:43,511 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:00:43,511 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:00:43,511 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:00:43,512 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:00:43,512 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:00:43,522 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:00:43,574 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,575 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:43,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:00:43,731 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:00:43,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:43 WrapperNode [2022-07-12 11:00:43,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:00:43,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:00:43,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:00:43,733 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:00:43,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:43" (1/1) ... [2022-07-12 11:00:43,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:43" (1/1) ... [2022-07-12 11:00:43,904 INFO L137 Inliner]: procedures = 691, calls = 2656, calls flagged for inlining = 59, calls inlined = 6, statements flattened = 925 [2022-07-12 11:00:43,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:00:43,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:00:43,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:00:43,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:00:43,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:43" (1/1) ... [2022-07-12 11:00:43,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:43" (1/1) ... [2022-07-12 11:00:43,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:43" (1/1) ... [2022-07-12 11:00:43,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:43" (1/1) ... [2022-07-12 11:00:43,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:43" (1/1) ... [2022-07-12 11:00:43,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:43" (1/1) ... [2022-07-12 11:00:43,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:43" (1/1) ... [2022-07-12 11:00:43,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:00:43,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:00:43,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:00:43,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:00:43,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:43" (1/1) ... [2022-07-12 11:00:43,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:00:44,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:44,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 11:00:44,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 11:00:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-12 11:00:44,064 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-12 11:00:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_compare_lexical [2022-07-12 11:00:44,065 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_compare_lexical [2022-07-12 11:00:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-12 11:00:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:00:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 11:00:44,065 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 11:00:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:00:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_bounded [2022-07-12 11:00:44,066 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_bounded [2022-07-12 11:00:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:00:44,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:00:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:00:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:00:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2022-07-12 11:00:44,068 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2022-07-12 11:00:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:00:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:00:44,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:00:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 11:00:44,069 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 11:00:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-12 11:00:44,069 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-12 11:00:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:00:44,069 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:00:44,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:00:44,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:00:44,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:00:44,070 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 11:00:44,070 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 11:00:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:00:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-12 11:00:44,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-12 11:00:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:00:44,259 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:00:44,261 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:00:44,983 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:00:44,990 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:00:44,990 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 11:00:44,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:00:44 BoogieIcfgContainer [2022-07-12 11:00:44,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:00:44,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:00:44,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:00:44,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:00:44,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:00:42" (1/3) ... [2022-07-12 11:00:44,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4a4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:00:44, skipping insertion in model container [2022-07-12 11:00:44,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:43" (2/3) ... [2022-07-12 11:00:44,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4a4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:00:44, skipping insertion in model container [2022-07-12 11:00:44,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:00:44" (3/3) ... [2022-07-12 11:00:44,997 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_compare_lexical_harness.i [2022-07-12 11:00:45,006 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:00:45,006 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:00:45,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:00:45,056 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@631443c3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5f6726e3 [2022-07-12 11:00:45,056 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:00:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 93 states have internal predecessors, (113), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-12 11:00:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 11:00:45,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:45,073 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 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-12 11:00:45,073 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:45,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:45,077 INFO L85 PathProgramCache]: Analyzing trace with hash 616113637, now seen corresponding path program 1 times [2022-07-12 11:00:45,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:45,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011038838] [2022-07-12 11:00:45,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:45,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:00:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:00:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:00:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:00:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:00:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:00:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:00:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:00:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:00:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:00:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:00:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:00:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:00:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:00:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:00:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 11:00:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:00:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-12 11:00:45,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:45,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011038838] [2022-07-12 11:00:45,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011038838] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:45,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581512897] [2022-07-12 11:00:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:45,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:45,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:45,912 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:00:45,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 11:00:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:46,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 2699 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 11:00:46,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-12 11:00:46,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:00:46,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581512897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:00:46,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:00:46,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-12 11:00:46,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536528273] [2022-07-12 11:00:46,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:00:46,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:00:46,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:46,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:00:46,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:00:46,530 INFO L87 Difference]: Start difference. First operand has 151 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 93 states have internal predecessors, (113), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 11:00:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:46,771 INFO L93 Difference]: Finished difference Result 301 states and 447 transitions. [2022-07-12 11:00:46,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:00:46,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 120 [2022-07-12 11:00:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:46,784 INFO L225 Difference]: With dead ends: 301 [2022-07-12 11:00:46,784 INFO L226 Difference]: Without dead ends: 148 [2022-07-12 11:00:46,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:00:46,796 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 222 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:46,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 422 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:00:46,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-12 11:00:46,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-07-12 11:00:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 89 states have (on average 1.202247191011236) internal successors, (107), 91 states have internal predecessors, (107), 46 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (51), 45 states have call predecessors, (51), 45 states have call successors, (51) [2022-07-12 11:00:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 204 transitions. [2022-07-12 11:00:46,831 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 204 transitions. Word has length 120 [2022-07-12 11:00:46,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:46,831 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 204 transitions. [2022-07-12 11:00:46,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 11:00:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 204 transitions. [2022-07-12 11:00:46,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 11:00:46,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:46,834 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:00:46,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:00:47,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-12 11:00:47,048 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:47,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:47,048 INFO L85 PathProgramCache]: Analyzing trace with hash 138900842, now seen corresponding path program 1 times [2022-07-12 11:00:47,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:47,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70079873] [2022-07-12 11:00:47,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:47,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:00:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:00:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:00:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:00:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:00:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:00:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:00:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:00:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:00:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:00:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:00:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:00:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:00:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:00:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:00:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:00:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:00:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-07-12 11:00:47,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:47,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70079873] [2022-07-12 11:00:47,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70079873] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:47,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485693700] [2022-07-12 11:00:47,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:47,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:47,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:47,445 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:00:47,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 11:00:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:47,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 2704 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:00:47,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-12 11:00:47,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:00:47,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485693700] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:00:47,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:00:47,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2022-07-12 11:00:47,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155892691] [2022-07-12 11:00:47,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:00:47,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:00:47,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:47,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:00:47,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-07-12 11:00:47,971 INFO L87 Difference]: Start difference. First operand 148 states and 204 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-12 11:00:48,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:48,285 INFO L93 Difference]: Finished difference Result 242 states and 337 transitions. [2022-07-12 11:00:48,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:00:48,285 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 122 [2022-07-12 11:00:48,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:48,287 INFO L225 Difference]: With dead ends: 242 [2022-07-12 11:00:48,287 INFO L226 Difference]: Without dead ends: 148 [2022-07-12 11:00:48,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-07-12 11:00:48,289 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 233 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:48,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 708 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:00:48,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-12 11:00:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-07-12 11:00:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 89 states have (on average 1.202247191011236) internal successors, (107), 91 states have internal predecessors, (107), 46 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2022-07-12 11:00:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 202 transitions. [2022-07-12 11:00:48,301 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 202 transitions. Word has length 122 [2022-07-12 11:00:48,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:48,301 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 202 transitions. [2022-07-12 11:00:48,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-12 11:00:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 202 transitions. [2022-07-12 11:00:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 11:00:48,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:48,303 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:00:48,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 11:00:48,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-07-12 11:00:48,525 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:48,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:48,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2034710092, now seen corresponding path program 2 times [2022-07-12 11:00:48,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:48,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740132297] [2022-07-12 11:00:48,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:48,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:00:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:00:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:00:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:00:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:00:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:00:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:00:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:00:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:00:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:00:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:00:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:00:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:00:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:00:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:00:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:00:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:00:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-07-12 11:00:48,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:48,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740132297] [2022-07-12 11:00:48,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740132297] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:48,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783515686] [2022-07-12 11:00:48,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:00:48,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:48,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:48,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:00:48,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 11:00:49,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 11:00:49,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:00:49,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 2312 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 11:00:49,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-07-12 11:00:49,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:00:49,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783515686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:00:49,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:00:49,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-12 11:00:49,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958183008] [2022-07-12 11:00:49,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:00:49,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:00:49,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:49,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:00:49,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:00:49,241 INFO L87 Difference]: Start difference. First operand 148 states and 202 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 11:00:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:49,316 INFO L93 Difference]: Finished difference Result 160 states and 221 transitions. [2022-07-12 11:00:49,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:00:49,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2022-07-12 11:00:49,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:49,320 INFO L225 Difference]: With dead ends: 160 [2022-07-12 11:00:49,320 INFO L226 Difference]: Without dead ends: 158 [2022-07-12 11:00:49,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:00:49,322 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 16 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:49,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1341 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:00:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-12 11:00:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2022-07-12 11:00:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 95 states have (on average 1.1894736842105262) internal successors, (113), 98 states have internal predecessors, (113), 47 states have call successors, (47), 12 states have call predecessors, (47), 14 states have return successors, (58), 46 states have call predecessors, (58), 46 states have call successors, (58) [2022-07-12 11:00:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 218 transitions. [2022-07-12 11:00:49,350 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 218 transitions. Word has length 126 [2022-07-12 11:00:49,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:49,352 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 218 transitions. [2022-07-12 11:00:49,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 11:00:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 218 transitions. [2022-07-12 11:00:49,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 11:00:49,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:49,354 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 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, 1, 1, 1, 1] [2022-07-12 11:00:49,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 11:00:49,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:49,563 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:49,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1275067964, now seen corresponding path program 1 times [2022-07-12 11:00:49,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:49,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666120312] [2022-07-12 11:00:49,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:00:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:00:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:00:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:00:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:00:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:00:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:00:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:00:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:00:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:00:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:00:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:00:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:00:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:00:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:00:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:00:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:00:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-07-12 11:00:49,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:49,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666120312] [2022-07-12 11:00:49,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666120312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:49,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429695368] [2022-07-12 11:00:49,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:49,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:49,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:49,829 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-12 11:00:49,830 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-12 11:00:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:50,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 2726 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:00:50,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-12 11:00:50,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:00:50,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429695368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:00:50,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:00:50,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-12 11:00:50,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298401658] [2022-07-12 11:00:50,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:00:50,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:00:50,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:50,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:00:50,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:00:50,320 INFO L87 Difference]: Start difference. First operand 157 states and 218 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-12 11:00:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:50,595 INFO L93 Difference]: Finished difference Result 307 states and 437 transitions. [2022-07-12 11:00:50,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:00:50,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 130 [2022-07-12 11:00:50,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:50,597 INFO L225 Difference]: With dead ends: 307 [2022-07-12 11:00:50,597 INFO L226 Difference]: Without dead ends: 187 [2022-07-12 11:00:50,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-07-12 11:00:50,598 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 277 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:50,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 810 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:00:50,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-12 11:00:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-12 11:00:50,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 114 states have internal predecessors, (133), 60 states have call successors, (60), 13 states have call predecessors, (60), 15 states have return successors, (73), 59 states have call predecessors, (73), 59 states have call successors, (73) [2022-07-12 11:00:50,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 266 transitions. [2022-07-12 11:00:50,607 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 266 transitions. Word has length 130 [2022-07-12 11:00:50,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:50,607 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 266 transitions. [2022-07-12 11:00:50,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-12 11:00:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 266 transitions. [2022-07-12 11:00:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 11:00:50,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:50,608 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:00:50,627 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-12 11:00:50,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:50,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:50,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:50,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1527536575, now seen corresponding path program 1 times [2022-07-12 11:00:50,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:50,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511093555] [2022-07-12 11:00:50,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:50,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:00:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:00:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:00:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:00:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:00:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:00:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:00:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:00:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:00:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:00:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:00:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:00:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:00:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:00:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:00:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:00:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:00:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-12 11:00:51,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:51,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511093555] [2022-07-12 11:00:51,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511093555] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:51,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661837903] [2022-07-12 11:00:51,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:51,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:51,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:51,467 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-12 11:00:51,469 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-12 11:00:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 2731 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 11:00:51,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:51,991 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-12 11:00:51,996 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-12 11:00:52,321 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 15 treesize of output 7 [2022-07-12 11:00:52,326 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 15 treesize of output 7 [2022-07-12 11:00:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-12 11:00:52,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:00:52,819 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 38 treesize of output 32 [2022-07-12 11:00:52,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:00:52,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:00:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-12 11:00:52,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661837903] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:00:52,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:00:52,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 12] total 31 [2022-07-12 11:00:52,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760050001] [2022-07-12 11:00:52,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:00:52,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 11:00:52,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:52,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 11:00:52,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2022-07-12 11:00:52,856 INFO L87 Difference]: Start difference. First operand 187 states and 266 transitions. Second operand has 31 states, 27 states have (on average 4.074074074074074) internal successors, (110), 24 states have internal predecessors, (110), 14 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (54), 11 states have call predecessors, (54), 13 states have call successors, (54) [2022-07-12 11:00:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:55,715 INFO L93 Difference]: Finished difference Result 495 states and 722 transitions. [2022-07-12 11:00:55,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-12 11:00:55,715 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 4.074074074074074) internal successors, (110), 24 states have internal predecessors, (110), 14 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (54), 11 states have call predecessors, (54), 13 states have call successors, (54) Word has length 132 [2022-07-12 11:00:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:55,717 INFO L225 Difference]: With dead ends: 495 [2022-07-12 11:00:55,717 INFO L226 Difference]: Without dead ends: 288 [2022-07-12 11:00:55,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 286 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=281, Invalid=2911, Unknown=0, NotChecked=0, Total=3192 [2022-07-12 11:00:55,719 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 346 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 3923 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 4668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 3923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 410 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:55,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1296 Invalid, 4668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 3923 Invalid, 0 Unknown, 410 Unchecked, 2.2s Time] [2022-07-12 11:00:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-07-12 11:00:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 273. [2022-07-12 11:00:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 158 states have (on average 1.1962025316455696) internal successors, (189), 164 states have internal predecessors, (189), 95 states have call successors, (95), 15 states have call predecessors, (95), 19 states have return successors, (123), 93 states have call predecessors, (123), 94 states have call successors, (123) [2022-07-12 11:00:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 407 transitions. [2022-07-12 11:00:55,749 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 407 transitions. Word has length 132 [2022-07-12 11:00:55,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:55,750 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 407 transitions. [2022-07-12 11:00:55,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 4.074074074074074) internal successors, (110), 24 states have internal predecessors, (110), 14 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (54), 11 states have call predecessors, (54), 13 states have call successors, (54) [2022-07-12 11:00:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 407 transitions. [2022-07-12 11:00:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-12 11:00:55,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:55,752 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:00:55,774 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-12 11:00:55,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:55,966 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:55,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:55,966 INFO L85 PathProgramCache]: Analyzing trace with hash -132654696, now seen corresponding path program 1 times [2022-07-12 11:00:55,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:55,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532997484] [2022-07-12 11:00:55,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:55,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:00:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:00:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:00:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:00:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:00:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:00:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:00:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:00:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:00:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:00:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:00:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:00:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:00:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:00:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:00:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:00:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:00:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:00:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-12 11:00:56,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:56,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532997484] [2022-07-12 11:00:56,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532997484] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:56,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675134174] [2022-07-12 11:00:56,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:56,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:56,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:56,647 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-12 11:00:56,649 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-12 11:00:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 2766 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-12 11:00:57,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:57,034 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 10 treesize of output 8 [2022-07-12 11:00:57,449 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 11:00:57,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-07-12 11:01:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 132 proven. 16 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-12 11:01:00,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:05,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675134174] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:05,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:01:05,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 36 [2022-07-12 11:01:05,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161193579] [2022-07-12 11:01:05,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:05,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 11:01:05,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:05,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 11:01:05,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1414, Unknown=2, NotChecked=0, Total=1560 [2022-07-12 11:01:05,226 INFO L87 Difference]: Start difference. First operand 273 states and 407 transitions. Second operand has 36 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 31 states have internal predecessors, (110), 14 states have call successors, (43), 10 states have call predecessors, (43), 9 states have return successors, (39), 11 states have call predecessors, (39), 12 states have call successors, (39) [2022-07-12 11:01:14,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:14,642 INFO L93 Difference]: Finished difference Result 727 states and 1106 transitions. [2022-07-12 11:01:14,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-12 11:01:14,642 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 31 states have internal predecessors, (110), 14 states have call successors, (43), 10 states have call predecessors, (43), 9 states have return successors, (39), 11 states have call predecessors, (39), 12 states have call successors, (39) Word has length 143 [2022-07-12 11:01:14,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:14,646 INFO L225 Difference]: With dead ends: 727 [2022-07-12 11:01:14,646 INFO L226 Difference]: Without dead ends: 534 [2022-07-12 11:01:14,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 234 SyntacticMatches, 24 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1781 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=511, Invalid=5031, Unknown=8, NotChecked=0, Total=5550 [2022-07-12 11:01:14,659 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 404 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 3911 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 6258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 3911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1991 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:14,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1941 Invalid, 6258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 3911 Invalid, 0 Unknown, 1991 Unchecked, 2.5s Time] [2022-07-12 11:01:14,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-07-12 11:01:14,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 423. [2022-07-12 11:01:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 248 states have (on average 1.1774193548387097) internal successors, (292), 255 states have internal predecessors, (292), 147 states have call successors, (147), 22 states have call predecessors, (147), 27 states have return successors, (187), 145 states have call predecessors, (187), 146 states have call successors, (187) [2022-07-12 11:01:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 626 transitions. [2022-07-12 11:01:14,707 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 626 transitions. Word has length 143 [2022-07-12 11:01:14,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:14,707 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 626 transitions. [2022-07-12 11:01:14,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 31 states have internal predecessors, (110), 14 states have call successors, (43), 10 states have call predecessors, (43), 9 states have return successors, (39), 11 states have call predecessors, (39), 12 states have call successors, (39) [2022-07-12 11:01:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 626 transitions. [2022-07-12 11:01:14,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-12 11:01:14,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:14,717 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:14,740 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-12 11:01:14,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:14,923 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:14,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash -845476291, now seen corresponding path program 1 times [2022-07-12 11:01:14,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:14,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118770925] [2022-07-12 11:01:14,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:14,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:01:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:01:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:01:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:01:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:01:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:01:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:01:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:01:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:01:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:01:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:01:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:01:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,265 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-12 11:01:15,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:15,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118770925] [2022-07-12 11:01:15,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118770925] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:15,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:15,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 11:01:15,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449170541] [2022-07-12 11:01:15,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:15,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 11:01:15,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:15,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 11:01:15,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:01:15,267 INFO L87 Difference]: Start difference. First operand 423 states and 626 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-12 11:01:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:16,048 INFO L93 Difference]: Finished difference Result 449 states and 678 transitions. [2022-07-12 11:01:16,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 11:01:16,048 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2022-07-12 11:01:16,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:16,053 INFO L225 Difference]: With dead ends: 449 [2022-07-12 11:01:16,053 INFO L226 Difference]: Without dead ends: 447 [2022-07-12 11:01:16,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-07-12 11:01:16,055 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 161 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:16,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 778 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 11:01:16,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-07-12 11:01:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2022-07-12 11:01:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 261 states have (on average 1.1685823754789273) internal successors, (305), 270 states have internal predecessors, (305), 151 states have call successors, (151), 23 states have call predecessors, (151), 30 states have return successors, (216), 149 states have call predecessors, (216), 150 states have call successors, (216) [2022-07-12 11:01:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 672 transitions. [2022-07-12 11:01:16,090 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 672 transitions. Word has length 145 [2022-07-12 11:01:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:16,090 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 672 transitions. [2022-07-12 11:01:16,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-12 11:01:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 672 transitions. [2022-07-12 11:01:16,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-12 11:01:16,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:16,093 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:16,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 11:01:16,093 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:16,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:16,094 INFO L85 PathProgramCache]: Analyzing trace with hash -144411713, now seen corresponding path program 1 times [2022-07-12 11:01:16,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:16,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852300799] [2022-07-12 11:01:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:16,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:01:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:01:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:01:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:01:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:01:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:01:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:01:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:01:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:01:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:01:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:01:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:01:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-12 11:01:16,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:16,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852300799] [2022-07-12 11:01:16,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852300799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:16,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:16,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-12 11:01:16,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342953908] [2022-07-12 11:01:16,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:16,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 11:01:16,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:16,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 11:01:16,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:01:16,442 INFO L87 Difference]: Start difference. First operand 443 states and 672 transitions. Second operand has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-12 11:01:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:17,545 INFO L93 Difference]: Finished difference Result 460 states and 712 transitions. [2022-07-12 11:01:17,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 11:01:17,546 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2022-07-12 11:01:17,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:17,548 INFO L225 Difference]: With dead ends: 460 [2022-07-12 11:01:17,548 INFO L226 Difference]: Without dead ends: 458 [2022-07-12 11:01:17,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2022-07-12 11:01:17,549 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 241 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:17,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 901 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 11:01:17,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-07-12 11:01:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 435. [2022-07-12 11:01:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 255 states have (on average 1.1725490196078432) internal successors, (299), 263 states have internal predecessors, (299), 150 states have call successors, (150), 23 states have call predecessors, (150), 29 states have return successors, (212), 148 states have call predecessors, (212), 149 states have call successors, (212) [2022-07-12 11:01:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 661 transitions. [2022-07-12 11:01:17,580 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 661 transitions. Word has length 145 [2022-07-12 11:01:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:17,580 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 661 transitions. [2022-07-12 11:01:17,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-12 11:01:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 661 transitions. [2022-07-12 11:01:17,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-12 11:01:17,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:17,582 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:17,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 11:01:17,582 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:17,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:17,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1764210556, now seen corresponding path program 1 times [2022-07-12 11:01:17,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:17,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581861512] [2022-07-12 11:01:17,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:17,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:01:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:01:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:01:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:01:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:01:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:01:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:01:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:01:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:01:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 11:01:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:01:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:01:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 11:01:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 19 proven. 24 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-07-12 11:01:17,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:17,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581861512] [2022-07-12 11:01:17,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581861512] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:17,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123311167] [2022-07-12 11:01:17,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:17,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:17,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:17,940 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-12 11:01:17,941 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-12 11:01:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:18,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 2825 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:01:18,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-12 11:01:18,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:18,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123311167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:18,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:18,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 13 [2022-07-12 11:01:18,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623263527] [2022-07-12 11:01:18,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:18,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:01:18,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:18,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:01:18,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:01:18,383 INFO L87 Difference]: Start difference. First operand 435 states and 661 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 11:01:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:18,571 INFO L93 Difference]: Finished difference Result 746 states and 1137 transitions. [2022-07-12 11:01:18,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:01:18,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 154 [2022-07-12 11:01:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:18,574 INFO L225 Difference]: With dead ends: 746 [2022-07-12 11:01:18,574 INFO L226 Difference]: Without dead ends: 435 [2022-07-12 11:01:18,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:01:18,577 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 12 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:18,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1424 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:01:18,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-07-12 11:01:18,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2022-07-12 11:01:18,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 255 states have (on average 1.1725490196078432) internal successors, (299), 263 states have internal predecessors, (299), 150 states have call successors, (150), 23 states have call predecessors, (150), 29 states have return successors, (208), 148 states have call predecessors, (208), 149 states have call successors, (208) [2022-07-12 11:01:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 657 transitions. [2022-07-12 11:01:18,617 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 657 transitions. Word has length 154 [2022-07-12 11:01:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:18,617 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 657 transitions. [2022-07-12 11:01:18,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 11:01:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 657 transitions. [2022-07-12 11:01:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 11:01:18,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:18,619 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:18,642 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-12 11:01:18,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:18,835 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:18,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:18,836 INFO L85 PathProgramCache]: Analyzing trace with hash -386866604, now seen corresponding path program 1 times [2022-07-12 11:01:18,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:18,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786784762] [2022-07-12 11:01:18,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:18,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:18,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:18,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:18,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:18,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:18,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:18,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:18,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:01:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:01:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:01:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:01:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:01:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:01:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:01:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:01:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:01:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:01:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:01:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:01:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 11:01:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:01:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2022-07-12 11:01:19,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:19,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786784762] [2022-07-12 11:01:19,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786784762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:19,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:19,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 11:01:19,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871986681] [2022-07-12 11:01:19,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:19,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:01:19,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:19,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:01:19,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:01:19,109 INFO L87 Difference]: Start difference. First operand 435 states and 657 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-12 11:01:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:19,789 INFO L93 Difference]: Finished difference Result 451 states and 677 transitions. [2022-07-12 11:01:19,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 11:01:19,789 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) Word has length 153 [2022-07-12 11:01:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:19,792 INFO L225 Difference]: With dead ends: 451 [2022-07-12 11:01:19,792 INFO L226 Difference]: Without dead ends: 449 [2022-07-12 11:01:19,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:01:19,792 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 151 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:19,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 640 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 11:01:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-07-12 11:01:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 444. [2022-07-12 11:01:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 258 states have (on average 1.1705426356589148) internal successors, (302), 266 states have internal predecessors, (302), 155 states have call successors, (155), 24 states have call predecessors, (155), 30 states have return successors, (213), 153 states have call predecessors, (213), 154 states have call successors, (213) [2022-07-12 11:01:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 670 transitions. [2022-07-12 11:01:19,821 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 670 transitions. Word has length 153 [2022-07-12 11:01:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:19,822 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 670 transitions. [2022-07-12 11:01:19,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-12 11:01:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 670 transitions. [2022-07-12 11:01:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-12 11:01:19,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:19,839 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:19,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 11:01:19,839 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:19,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:19,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1630309929, now seen corresponding path program 1 times [2022-07-12 11:01:19,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:19,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359052946] [2022-07-12 11:01:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:19,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:19,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:01:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:01:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:01:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:01:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:01:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:01:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:01:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:01:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:01:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:01:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 11:01:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:01:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:01:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2022-07-12 11:01:20,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:20,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359052946] [2022-07-12 11:01:20,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359052946] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:20,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113497861] [2022-07-12 11:01:20,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:20,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:20,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:20,116 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-12 11:01:20,144 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-12 11:01:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 2830 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 11:01:20,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:20,561 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-07-12 11:01:20,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:20,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113497861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:20,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:20,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2022-07-12 11:01:20,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415676202] [2022-07-12 11:01:20,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:20,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:01:20,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:20,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:01:20,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:01:20,563 INFO L87 Difference]: Start difference. First operand 444 states and 670 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 11:01:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:20,756 INFO L93 Difference]: Finished difference Result 823 states and 1278 transitions. [2022-07-12 11:01:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:01:20,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 156 [2022-07-12 11:01:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:20,759 INFO L225 Difference]: With dead ends: 823 [2022-07-12 11:01:20,759 INFO L226 Difference]: Without dead ends: 444 [2022-07-12 11:01:20,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:01:20,761 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 17 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:20,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 694 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2022-07-12 11:01:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-07-12 11:01:20,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2022-07-12 11:01:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 258 states have (on average 1.1627906976744187) internal successors, (300), 266 states have internal predecessors, (300), 155 states have call successors, (155), 24 states have call predecessors, (155), 30 states have return successors, (213), 153 states have call predecessors, (213), 154 states have call successors, (213) [2022-07-12 11:01:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 668 transitions. [2022-07-12 11:01:20,789 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 668 transitions. Word has length 156 [2022-07-12 11:01:20,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:20,789 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 668 transitions. [2022-07-12 11:01:20,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 11:01:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 668 transitions. [2022-07-12 11:01:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-12 11:01:20,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:20,791 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:20,815 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-12 11:01:21,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 11:01:21,011 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:21,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:21,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1137683755, now seen corresponding path program 1 times [2022-07-12 11:01:21,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:21,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032601512] [2022-07-12 11:01:21,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:21,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:01:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:01:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:01:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:01:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:01:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:01:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:01:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:01:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:01:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:01:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 11:01:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:01:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:01:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2022-07-12 11:01:22,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:22,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032601512] [2022-07-12 11:01:22,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032601512] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:22,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247527662] [2022-07-12 11:01:22,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:22,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:22,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:22,010 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-12 11:01:22,011 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-12 11:01:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 2835 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 11:01:22,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:22,811 INFO L356 Elim1Store]: treesize reduction 70, result has 26.3 percent of original size [2022-07-12 11:01:22,812 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 2 case distinctions, treesize of input 30 treesize of output 39 [2022-07-12 11:01:22,939 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 11:01:22,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2022-07-12 11:01:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 160 proven. 12 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-12 11:01:23,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:23,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 11:01:23,436 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:01:23,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2022-07-12 11:01:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2022-07-12 11:01:23,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247527662] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:01:23,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:01:23,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 13, 11] total 41 [2022-07-12 11:01:23,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570790736] [2022-07-12 11:01:23,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:23,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 11:01:23,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:23,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 11:01:23,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1521, Unknown=0, NotChecked=0, Total=1640 [2022-07-12 11:01:23,488 INFO L87 Difference]: Start difference. First operand 444 states and 668 transitions. Second operand has 41 states, 37 states have (on average 3.675675675675676) internal successors, (136), 36 states have internal predecessors, (136), 16 states have call successors, (56), 9 states have call predecessors, (56), 12 states have return successors, (53), 14 states have call predecessors, (53), 16 states have call successors, (53) [2022-07-12 11:01:29,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:29,776 INFO L93 Difference]: Finished difference Result 937 states and 1448 transitions. [2022-07-12 11:01:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-12 11:01:29,788 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 3.675675675675676) internal successors, (136), 36 states have internal predecessors, (136), 16 states have call successors, (56), 9 states have call predecessors, (56), 12 states have return successors, (53), 14 states have call predecessors, (53), 16 states have call successors, (53) Word has length 156 [2022-07-12 11:01:29,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:29,792 INFO L225 Difference]: With dead ends: 937 [2022-07-12 11:01:29,792 INFO L226 Difference]: Without dead ends: 652 [2022-07-12 11:01:29,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 331 SyntacticMatches, 11 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=487, Invalid=5063, Unknown=0, NotChecked=0, Total=5550 [2022-07-12 11:01:29,794 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 277 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 7788 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 8673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 7788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 578 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:29,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1683 Invalid, 8673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 7788 Invalid, 0 Unknown, 578 Unchecked, 4.8s Time] [2022-07-12 11:01:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-07-12 11:01:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 533. [2022-07-12 11:01:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 309 states have (on average 1.1715210355987056) internal successors, (362), 315 states have internal predecessors, (362), 191 states have call successors, (191), 28 states have call predecessors, (191), 32 states have return successors, (258), 189 states have call predecessors, (258), 190 states have call successors, (258) [2022-07-12 11:01:29,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 811 transitions. [2022-07-12 11:01:29,832 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 811 transitions. Word has length 156 [2022-07-12 11:01:29,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:29,832 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 811 transitions. [2022-07-12 11:01:29,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 3.675675675675676) internal successors, (136), 36 states have internal predecessors, (136), 16 states have call successors, (56), 9 states have call predecessors, (56), 12 states have return successors, (53), 14 states have call predecessors, (53), 16 states have call successors, (53) [2022-07-12 11:01:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 811 transitions. [2022-07-12 11:01:29,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-12 11:01:29,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:29,835 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:29,864 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-12 11:01:30,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:30,047 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:30,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:30,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1267128233, now seen corresponding path program 2 times [2022-07-12 11:01:30,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:30,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371420119] [2022-07-12 11:01:30,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:30,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:01:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:01:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:01:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:01:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:01:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:01:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:01:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:01:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:01:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:01:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 11:01:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:01:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:01:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-07-12 11:01:30,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:30,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371420119] [2022-07-12 11:01:30,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371420119] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:30,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119199749] [2022-07-12 11:01:30,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:01:30,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:30,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:30,788 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-12 11:01:30,789 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-12 11:01:31,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:01:31,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:01:31,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 2835 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-12 11:01:31,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 133 proven. 9 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-12 11:01:32,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 43 proven. 9 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-07-12 11:01:33,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119199749] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:01:33,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:01:33,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 15] total 52 [2022-07-12 11:01:33,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019500737] [2022-07-12 11:01:33,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:33,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-12 11:01:33,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:33,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-12 11:01:33,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2485, Unknown=0, NotChecked=0, Total=2652 [2022-07-12 11:01:33,592 INFO L87 Difference]: Start difference. First operand 533 states and 811 transitions. Second operand has 52 states, 45 states have (on average 3.1777777777777776) internal successors, (143), 44 states have internal predecessors, (143), 17 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (62), 14 states have call predecessors, (62), 16 states have call successors, (62) [2022-07-12 11:01:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:38,822 INFO L93 Difference]: Finished difference Result 834 states and 1265 transitions. [2022-07-12 11:01:38,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-12 11:01:38,823 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 45 states have (on average 3.1777777777777776) internal successors, (143), 44 states have internal predecessors, (143), 17 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (62), 14 states have call predecessors, (62), 16 states have call successors, (62) Word has length 156 [2022-07-12 11:01:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:38,832 INFO L225 Difference]: With dead ends: 834 [2022-07-12 11:01:38,833 INFO L226 Difference]: Without dead ends: 612 [2022-07-12 11:01:38,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 325 SyntacticMatches, 6 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2517 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=716, Invalid=9184, Unknown=0, NotChecked=0, Total=9900 [2022-07-12 11:01:38,837 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 423 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 6605 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 7982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 6605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 962 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:38,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1670 Invalid, 7982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 6605 Invalid, 0 Unknown, 962 Unchecked, 3.4s Time] [2022-07-12 11:01:38,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-07-12 11:01:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 571. [2022-07-12 11:01:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 341 states have (on average 1.1759530791788857) internal successors, (401), 347 states have internal predecessors, (401), 193 states have call successors, (193), 32 states have call predecessors, (193), 36 states have return successors, (280), 191 states have call predecessors, (280), 192 states have call successors, (280) [2022-07-12 11:01:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 874 transitions. [2022-07-12 11:01:38,897 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 874 transitions. Word has length 156 [2022-07-12 11:01:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:38,897 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 874 transitions. [2022-07-12 11:01:38,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 45 states have (on average 3.1777777777777776) internal successors, (143), 44 states have internal predecessors, (143), 17 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (62), 14 states have call predecessors, (62), 16 states have call successors, (62) [2022-07-12 11:01:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 874 transitions. [2022-07-12 11:01:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 11:01:38,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:38,899 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:38,929 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-12 11:01:39,115 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,SelfDestructingSolverStorable12 [2022-07-12 11:01:39,116 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:39,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:39,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1021216476, now seen corresponding path program 1 times [2022-07-12 11:01:39,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:39,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393627032] [2022-07-12 11:01:39,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:39,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:01:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:01:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:01:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:01:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:01:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:01:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:01:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:01:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:01:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:01:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:01:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:01:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 11:01:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:01:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-07-12 11:01:39,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:39,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393627032] [2022-07-12 11:01:39,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393627032] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:39,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509525987] [2022-07-12 11:01:39,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:39,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:39,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:39,589 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-12 11:01:39,590 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-12 11:01:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:40,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 2798 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-12 11:01:40,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:40,124 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-12 11:01:40,420 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 17 treesize of output 13 [2022-07-12 11:01:40,424 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 22 treesize of output 14 [2022-07-12 11:01:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-12 11:01:41,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:41,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509525987] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:41,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:41,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [16] total 32 [2022-07-12 11:01:41,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990119544] [2022-07-12 11:01:41,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:41,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 11:01:41,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:41,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 11:01:41,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2022-07-12 11:01:41,463 INFO L87 Difference]: Start difference. First operand 571 states and 874 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 7 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-12 11:01:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:42,336 INFO L93 Difference]: Finished difference Result 878 states and 1297 transitions. [2022-07-12 11:01:42,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 11:01:42,336 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 7 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) Word has length 157 [2022-07-12 11:01:42,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:42,339 INFO L225 Difference]: With dead ends: 878 [2022-07-12 11:01:42,340 INFO L226 Difference]: Without dead ends: 673 [2022-07-12 11:01:42,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 161 SyntacticMatches, 28 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=1657, Unknown=0, NotChecked=0, Total=1806 [2022-07-12 11:01:42,341 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 156 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 766 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:42,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 884 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1240 Invalid, 0 Unknown, 766 Unchecked, 0.6s Time] [2022-07-12 11:01:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-07-12 11:01:42,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 652. [2022-07-12 11:01:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 396 states have (on average 1.1717171717171717) internal successors, (464), 403 states have internal predecessors, (464), 211 states have call successors, (211), 39 states have call predecessors, (211), 44 states have return successors, (306), 209 states have call predecessors, (306), 210 states have call successors, (306) [2022-07-12 11:01:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 981 transitions. [2022-07-12 11:01:42,396 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 981 transitions. Word has length 157 [2022-07-12 11:01:42,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:42,397 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 981 transitions. [2022-07-12 11:01:42,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 7 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-12 11:01:42,397 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 981 transitions. [2022-07-12 11:01:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 11:01:42,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:42,400 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:42,420 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-12 11:01:42,611 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,SelfDestructingSolverStorable13 [2022-07-12 11:01:42,612 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:42,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:42,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1279381914, now seen corresponding path program 1 times [2022-07-12 11:01:42,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:42,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390573308] [2022-07-12 11:01:42,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:42,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:01:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:01:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:01:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:01:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:01:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:01:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:01:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:01:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:01:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:01:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:01:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:01:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 11:01:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:01:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-07-12 11:01:42,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:42,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390573308] [2022-07-12 11:01:42,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390573308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:42,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:42,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:01:42,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424939969] [2022-07-12 11:01:42,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:42,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:01:42,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:42,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:01:42,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:01:42,847 INFO L87 Difference]: Start difference. First operand 652 states and 981 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-12 11:01:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:43,286 INFO L93 Difference]: Finished difference Result 1252 states and 1929 transitions. [2022-07-12 11:01:43,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:01:43,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) Word has length 157 [2022-07-12 11:01:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:43,289 INFO L225 Difference]: With dead ends: 1252 [2022-07-12 11:01:43,290 INFO L226 Difference]: Without dead ends: 635 [2022-07-12 11:01:43,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:01:43,294 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 202 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:43,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 343 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:01:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-07-12 11:01:43,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2022-07-12 11:01:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 384 states have (on average 1.1588541666666667) internal successors, (445), 389 states have internal predecessors, (445), 208 states have call successors, (208), 39 states have call predecessors, (208), 42 states have return successors, (278), 206 states have call predecessors, (278), 207 states have call successors, (278) [2022-07-12 11:01:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 931 transitions. [2022-07-12 11:01:43,336 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 931 transitions. Word has length 157 [2022-07-12 11:01:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:43,337 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 931 transitions. [2022-07-12 11:01:43,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-12 11:01:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 931 transitions. [2022-07-12 11:01:43,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-12 11:01:43,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:43,339 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:43,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 11:01:43,339 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:43,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:43,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1258471427, now seen corresponding path program 1 times [2022-07-12 11:01:43,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:43,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135223836] [2022-07-12 11:01:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:43,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:01:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:01:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:01:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:01:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:01:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:01:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:01:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:01:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:01:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:01:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:01:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:01:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 11:01:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:01:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2022-07-12 11:01:43,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:43,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135223836] [2022-07-12 11:01:43,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135223836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:43,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:43,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-12 11:01:43,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845975725] [2022-07-12 11:01:43,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:43,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 11:01:43,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:43,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 11:01:43,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:01:43,643 INFO L87 Difference]: Start difference. First operand 635 states and 931 transitions. Second operand has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-12 11:01:44,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:44,691 INFO L93 Difference]: Finished difference Result 658 states and 959 transitions. [2022-07-12 11:01:44,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 11:01:44,692 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2022-07-12 11:01:44,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:44,696 INFO L225 Difference]: With dead ends: 658 [2022-07-12 11:01:44,696 INFO L226 Difference]: Without dead ends: 656 [2022-07-12 11:01:44,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2022-07-12 11:01:44,696 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 227 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:44,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 899 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 11:01:44,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-07-12 11:01:44,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 645. [2022-07-12 11:01:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 387 states have (on average 1.1576227390180878) internal successors, (448), 392 states have internal predecessors, (448), 214 states have call successors, (214), 40 states have call predecessors, (214), 43 states have return successors, (284), 212 states have call predecessors, (284), 213 states have call successors, (284) [2022-07-12 11:01:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 946 transitions. [2022-07-12 11:01:44,739 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 946 transitions. Word has length 159 [2022-07-12 11:01:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:44,739 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 946 transitions. [2022-07-12 11:01:44,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-12 11:01:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 946 transitions. [2022-07-12 11:01:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-12 11:01:44,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:44,742 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:44,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 11:01:44,742 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:44,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:44,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1665943078, now seen corresponding path program 1 times [2022-07-12 11:01:44,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:44,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804460620] [2022-07-12 11:01:44,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:44,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:01:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:01:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:01:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:01:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:01:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:01:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:01:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:01:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:01:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:01:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:01:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:01:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:01:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:01:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-07-12 11:01:45,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:45,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804460620] [2022-07-12 11:01:45,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804460620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:45,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:45,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:01:45,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927603427] [2022-07-12 11:01:45,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:45,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:01:45,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:45,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:01:45,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:01:45,077 INFO L87 Difference]: Start difference. First operand 645 states and 946 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2022-07-12 11:01:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:45,482 INFO L93 Difference]: Finished difference Result 957 states and 1406 transitions. [2022-07-12 11:01:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:01:45,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2022-07-12 11:01:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:45,486 INFO L225 Difference]: With dead ends: 957 [2022-07-12 11:01:45,486 INFO L226 Difference]: Without dead ends: 669 [2022-07-12 11:01:45,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:01:45,488 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 131 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:45,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 346 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:01:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-07-12 11:01:45,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 663. [2022-07-12 11:01:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 400 states have (on average 1.1525) internal successors, (461), 406 states have internal predecessors, (461), 214 states have call successors, (214), 40 states have call predecessors, (214), 48 states have return successors, (292), 216 states have call predecessors, (292), 213 states have call successors, (292) [2022-07-12 11:01:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 967 transitions. [2022-07-12 11:01:45,530 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 967 transitions. Word has length 164 [2022-07-12 11:01:45,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:45,531 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 967 transitions. [2022-07-12 11:01:45,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2022-07-12 11:01:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 967 transitions. [2022-07-12 11:01:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 11:01:45,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:45,533 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:45,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 11:01:45,533 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:45,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash -448225397, now seen corresponding path program 1 times [2022-07-12 11:01:45,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:45,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550792457] [2022-07-12 11:01:45,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:45,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:01:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:01:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:01:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:45,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:01:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:01:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:01:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 11:01:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:01:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:01:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 11:01:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 11:01:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:01:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:01:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:01:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 11:01:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2022-07-12 11:01:46,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:46,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550792457] [2022-07-12 11:01:46,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550792457] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:46,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712993677] [2022-07-12 11:01:46,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:46,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:46,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:46,094 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-12 11:01:46,095 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-12 11:01:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 2820 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 11:01:46,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:46,667 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-12 11:01:47,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:01:47,429 INFO L356 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2022-07-12 11:01:47,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 40 [2022-07-12 11:01:47,433 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 17 treesize of output 13 [2022-07-12 11:01:47,436 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 22 treesize of output 14 [2022-07-12 11:01:47,590 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 11:01:47,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2022-07-12 11:01:47,592 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 20 treesize of output 8 [2022-07-12 11:01:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-12 11:01:47,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:48,282 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 33 treesize of output 25 [2022-07-12 11:01:48,448 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:01:48,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 11:01:48,581 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-12 11:01:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2022-07-12 11:01:48,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712993677] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:01:48,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:01:48,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 18] total 53 [2022-07-12 11:01:48,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381922930] [2022-07-12 11:01:48,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:48,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-12 11:01:48,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:48,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-12 11:01:48,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2551, Unknown=0, NotChecked=0, Total=2756 [2022-07-12 11:01:48,764 INFO L87 Difference]: Start difference. First operand 663 states and 967 transitions. Second operand has 53 states, 47 states have (on average 3.5531914893617023) internal successors, (167), 44 states have internal predecessors, (167), 20 states have call successors, (59), 10 states have call predecessors, (59), 17 states have return successors, (57), 18 states have call predecessors, (57), 20 states have call successors, (57) [2022-07-12 11:01:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:51,827 INFO L93 Difference]: Finished difference Result 936 states and 1299 transitions. [2022-07-12 11:01:51,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-12 11:01:51,828 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 47 states have (on average 3.5531914893617023) internal successors, (167), 44 states have internal predecessors, (167), 20 states have call successors, (59), 10 states have call predecessors, (59), 17 states have return successors, (57), 18 states have call predecessors, (57), 20 states have call successors, (57) Word has length 163 [2022-07-12 11:01:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:51,831 INFO L225 Difference]: With dead ends: 936 [2022-07-12 11:01:51,831 INFO L226 Difference]: Without dead ends: 682 [2022-07-12 11:01:51,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 341 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2020 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=673, Invalid=6809, Unknown=0, NotChecked=0, Total=7482 [2022-07-12 11:01:51,833 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 467 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 3476 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 4618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 3476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 754 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:51,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1416 Invalid, 4618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 3476 Invalid, 0 Unknown, 754 Unchecked, 1.9s Time] [2022-07-12 11:01:51,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-07-12 11:01:51,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 609. [2022-07-12 11:01:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 382 states have (on average 1.143979057591623) internal successors, (437), 387 states have internal predecessors, (437), 177 states have call successors, (177), 43 states have call predecessors, (177), 49 states have return successors, (238), 178 states have call predecessors, (238), 176 states have call successors, (238) [2022-07-12 11:01:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 852 transitions. [2022-07-12 11:01:51,868 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 852 transitions. Word has length 163 [2022-07-12 11:01:51,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:51,868 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 852 transitions. [2022-07-12 11:01:51,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 47 states have (on average 3.5531914893617023) internal successors, (167), 44 states have internal predecessors, (167), 20 states have call successors, (59), 10 states have call predecessors, (59), 17 states have return successors, (57), 18 states have call predecessors, (57), 20 states have call successors, (57) [2022-07-12 11:01:51,869 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 852 transitions. [2022-07-12 11:01:51,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-12 11:01:51,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:51,870 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:51,890 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-12 11:01:52,090 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,SelfDestructingSolverStorable17 [2022-07-12 11:01:52,090 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:52,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:52,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1049417710, now seen corresponding path program 1 times [2022-07-12 11:01:52,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:52,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189415951] [2022-07-12 11:01:52,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:52,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:01:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:01:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:01:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:01:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:01:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:01:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:01:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:01:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:01:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:01:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:01:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:01:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:01:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:01:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 7 proven. 87 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-07-12 11:01:53,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:53,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189415951] [2022-07-12 11:01:53,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189415951] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:53,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630058179] [2022-07-12 11:01:53,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:53,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:53,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:53,325 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-12 11:01:53,326 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-12 11:01:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 2817 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-12 11:01:53,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:53,759 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 10 treesize of output 8 [2022-07-12 11:01:54,383 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 11:01:54,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-07-12 11:01:56,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 15 [2022-07-12 11:01:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-12 11:01:56,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:02,628 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int) (v_ArrVal_1502 Int)) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| .cse1) (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|) v_ArrVal_1502)) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.offset|))) (< (+ .cse0 (* 18446744073709551616 (div .cse1 18446744073709551616))) (+ .cse1 (* 18446744073709551616 (div .cse0 18446744073709551616)) 1))))) (forall ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int) (v_ArrVal_1502 Int)) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.offset|))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| .cse2) (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|) v_ArrVal_1502)) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.offset|))) (<= (+ .cse2 (* 18446744073709551616 (div .cse3 18446744073709551616))) (+ .cse3 (* 18446744073709551616 (div .cse2 18446744073709551616)))))))) is different from false [2022-07-12 11:02:02,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630058179] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:02,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:02:02,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 21] total 49 [2022-07-12 11:02:02,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943513060] [2022-07-12 11:02:02,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:02,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-12 11:02:02,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:02,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-12 11:02:02,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2550, Unknown=3, NotChecked=102, Total=2862 [2022-07-12 11:02:02,642 INFO L87 Difference]: Start difference. First operand 609 states and 852 transitions. Second operand has 49 states, 38 states have (on average 3.3947368421052633) internal successors, (129), 41 states have internal predecessors, (129), 21 states have call successors, (52), 8 states have call predecessors, (52), 12 states have return successors, (50), 14 states have call predecessors, (50), 19 states have call successors, (50) [2022-07-12 11:02:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:17,416 INFO L93 Difference]: Finished difference Result 822 states and 1124 transitions. [2022-07-12 11:02:17,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-12 11:02:17,416 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 38 states have (on average 3.3947368421052633) internal successors, (129), 41 states have internal predecessors, (129), 21 states have call successors, (52), 8 states have call predecessors, (52), 12 states have return successors, (50), 14 states have call predecessors, (50), 19 states have call successors, (50) Word has length 165 [2022-07-12 11:02:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:17,420 INFO L225 Difference]: With dead ends: 822 [2022-07-12 11:02:17,420 INFO L226 Difference]: Without dead ends: 752 [2022-07-12 11:02:17,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 304 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2771 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=728, Invalid=9163, Unknown=13, NotChecked=196, Total=10100 [2022-07-12 11:02:17,424 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 570 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 5200 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 7104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 5200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1421 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:17,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1707 Invalid, 7104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 5200 Invalid, 0 Unknown, 1421 Unchecked, 3.4s Time] [2022-07-12 11:02:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-07-12 11:02:17,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 665. [2022-07-12 11:02:17,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 419 states have (on average 1.1288782816229117) internal successors, (473), 423 states have internal predecessors, (473), 189 states have call successors, (189), 51 states have call predecessors, (189), 56 states have return successors, (250), 190 states have call predecessors, (250), 188 states have call successors, (250) [2022-07-12 11:02:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 912 transitions. [2022-07-12 11:02:17,494 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 912 transitions. Word has length 165 [2022-07-12 11:02:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:17,494 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 912 transitions. [2022-07-12 11:02:17,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 38 states have (on average 3.3947368421052633) internal successors, (129), 41 states have internal predecessors, (129), 21 states have call successors, (52), 8 states have call predecessors, (52), 12 states have return successors, (50), 14 states have call predecessors, (50), 19 states have call successors, (50) [2022-07-12 11:02:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 912 transitions. [2022-07-12 11:02:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-12 11:02:17,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:17,496 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:17,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:17,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:17,715 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:17,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:17,716 INFO L85 PathProgramCache]: Analyzing trace with hash -260269898, now seen corresponding path program 1 times [2022-07-12 11:02:17,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:17,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464331223] [2022-07-12 11:02:17,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:17,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:02:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:02:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:02:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:02:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:02:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:02:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:02:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:02:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:02:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:02:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 11:02:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:02:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:02:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 11:02:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 11:02:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 11:02:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 39 proven. 24 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-07-12 11:02:18,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:18,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464331223] [2022-07-12 11:02:18,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464331223] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:18,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504778710] [2022-07-12 11:02:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:18,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:18,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:18,702 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:18,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 11:02:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 2857 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:02:19,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:19,249 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-12 11:02:19,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:02:19,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504778710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:19,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:02:19,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [32] total 38 [2022-07-12 11:02:19,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602573670] [2022-07-12 11:02:19,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:19,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:02:19,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:19,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:02:19,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1307, Unknown=0, NotChecked=0, Total=1406 [2022-07-12 11:02:19,251 INFO L87 Difference]: Start difference. First operand 665 states and 912 transitions. Second operand has 9 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 11:02:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:19,439 INFO L93 Difference]: Finished difference Result 1044 states and 1453 transitions. [2022-07-12 11:02:19,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:02:19,439 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 168 [2022-07-12 11:02:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:19,442 INFO L225 Difference]: With dead ends: 1044 [2022-07-12 11:02:19,442 INFO L226 Difference]: Without dead ends: 665 [2022-07-12 11:02:19,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=1526, Unknown=0, NotChecked=0, Total=1640 [2022-07-12 11:02:19,444 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 10 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:19,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1398 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:02:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-07-12 11:02:19,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2022-07-12 11:02:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 419 states have (on average 1.126491646778043) internal successors, (472), 423 states have internal predecessors, (472), 189 states have call successors, (189), 51 states have call predecessors, (189), 56 states have return successors, (250), 190 states have call predecessors, (250), 188 states have call successors, (250) [2022-07-12 11:02:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 911 transitions. [2022-07-12 11:02:19,486 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 911 transitions. Word has length 168 [2022-07-12 11:02:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:19,487 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 911 transitions. [2022-07-12 11:02:19,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 11:02:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 911 transitions. [2022-07-12 11:02:19,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-12 11:02:19,489 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:19,489 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:19,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:19,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:19,709 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:19,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash 719923375, now seen corresponding path program 1 times [2022-07-12 11:02:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:19,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206141162] [2022-07-12 11:02:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:02:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:02:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:02:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:02:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:02:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:02:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:02:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:02:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:02:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:02:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:02:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 11:02:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:02:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:02:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:02:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 11:02:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 39 proven. 24 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-07-12 11:02:20,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:20,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206141162] [2022-07-12 11:02:20,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206141162] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:20,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317343534] [2022-07-12 11:02:20,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:20,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:20,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:20,598 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:20,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 11:02:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:20,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 2867 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-12 11:02:21,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:21,036 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:02:21,037 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 11:02:21,416 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-12 11:02:21,497 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-07-12 11:02:21,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 11:02:22,544 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 17 treesize of output 13 [2022-07-12 11:02:22,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:22,557 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 11:02:22,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-07-12 11:02:22,561 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 31 treesize of output 19 [2022-07-12 11:02:22,656 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-07-12 11:02:22,656 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 3 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 11:02:22,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:02:22,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:02:22,911 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-12 11:02:22,917 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_arrayElimArr_1 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_save_byte_from_array_#in~storage#1.base| v_arrayElimArr_1))) (exists ((v_ArrVal_1772 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_1772)))) is different from true [2022-07-12 11:02:22,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-12 11:02:22,942 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-12 11:02:22,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2022-07-12 11:02:22,949 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 18 treesize of output 14 [2022-07-12 11:02:23,011 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-12 11:02:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 171 proven. 18 refuted. 0 times theorem prover too weak. 112 trivial. 2 not checked. [2022-07-12 11:02:23,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:24,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:02:24,111 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-07-12 11:02:24,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#old_byte_from_lhs~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| 8)) 0))) is different from false [2022-07-12 11:02:24,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317343534] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:24,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:02:24,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28] total 59 [2022-07-12 11:02:24,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316183706] [2022-07-12 11:02:24,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:24,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-12 11:02:24,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:24,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-12 11:02:24,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=4428, Unknown=3, NotChecked=270, Total=4970 [2022-07-12 11:02:24,117 INFO L87 Difference]: Start difference. First operand 665 states and 911 transitions. Second operand has 59 states, 52 states have (on average 2.923076923076923) internal successors, (152), 48 states have internal predecessors, (152), 19 states have call successors, (51), 13 states have call predecessors, (51), 16 states have return successors, (48), 18 states have call predecessors, (48), 18 states have call successors, (48) [2022-07-12 11:02:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:32,276 INFO L93 Difference]: Finished difference Result 1447 states and 2093 transitions. [2022-07-12 11:02:32,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-07-12 11:02:32,276 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 52 states have (on average 2.923076923076923) internal successors, (152), 48 states have internal predecessors, (152), 19 states have call successors, (51), 13 states have call predecessors, (51), 16 states have return successors, (48), 18 states have call predecessors, (48), 18 states have call successors, (48) Word has length 170 [2022-07-12 11:02:32,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:32,280 INFO L225 Difference]: With dead ends: 1447 [2022-07-12 11:02:32,280 INFO L226 Difference]: Without dead ends: 1079 [2022-07-12 11:02:32,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 272 SyntacticMatches, 9 SemanticMatches, 135 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5350 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1249, Invalid=16815, Unknown=34, NotChecked=534, Total=18632 [2022-07-12 11:02:32,283 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 905 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 8554 mSolverCounterSat, 1039 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 12712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1039 IncrementalHoareTripleChecker+Valid, 8554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3119 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:32,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1743 Invalid, 12712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1039 Valid, 8554 Invalid, 0 Unknown, 3119 Unchecked, 5.3s Time] [2022-07-12 11:02:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2022-07-12 11:02:32,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 973. [2022-07-12 11:02:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 587 states have (on average 1.1465076660988074) internal successors, (673), 589 states have internal predecessors, (673), 315 states have call successors, (315), 64 states have call predecessors, (315), 70 states have return successors, (422), 319 states have call predecessors, (422), 313 states have call successors, (422) [2022-07-12 11:02:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1410 transitions. [2022-07-12 11:02:32,345 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1410 transitions. Word has length 170 [2022-07-12 11:02:32,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:32,346 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1410 transitions. [2022-07-12 11:02:32,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 52 states have (on average 2.923076923076923) internal successors, (152), 48 states have internal predecessors, (152), 19 states have call successors, (51), 13 states have call predecessors, (51), 16 states have return successors, (48), 18 states have call predecessors, (48), 18 states have call successors, (48) [2022-07-12 11:02:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1410 transitions. [2022-07-12 11:02:32,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-12 11:02:32,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:32,348 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:32,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:32,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:32,567 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:32,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:32,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1773315023, now seen corresponding path program 2 times [2022-07-12 11:02:32,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:32,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092730477] [2022-07-12 11:02:32,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:32,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:02:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:02:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:02:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:02:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:02:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:02:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:02:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:02:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:02:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:02:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:02:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:02:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 11:02:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:02:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:02:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:02:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:32,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 11:02:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 36 proven. 11 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-07-12 11:02:33,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:33,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092730477] [2022-07-12 11:02:33,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092730477] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:33,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561527554] [2022-07-12 11:02:33,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:02:33,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:33,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:33,002 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:33,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 11:02:33,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:02:33,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:02:33,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 2867 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-12 11:02:33,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:33,798 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 10 treesize of output 8 [2022-07-12 11:02:33,921 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-12 11:02:34,521 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 11:02:34,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-07-12 11:02:34,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 11:02:34,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-12 11:02:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 11:02:34,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:02:34,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561527554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:34,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:02:34,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [15] total 34 [2022-07-12 11:02:34,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042666138] [2022-07-12 11:02:34,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:34,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 11:02:34,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:34,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 11:02:34,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 11:02:34,705 INFO L87 Difference]: Start difference. First operand 973 states and 1410 transitions. Second operand has 21 states, 19 states have (on average 4.105263157894737) internal successors, (78), 16 states have internal predecessors, (78), 7 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2022-07-12 11:02:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:36,020 INFO L93 Difference]: Finished difference Result 1660 states and 2398 transitions. [2022-07-12 11:02:36,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 11:02:36,022 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 4.105263157894737) internal successors, (78), 16 states have internal predecessors, (78), 7 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) Word has length 170 [2022-07-12 11:02:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:36,028 INFO L225 Difference]: With dead ends: 1660 [2022-07-12 11:02:36,029 INFO L226 Difference]: Without dead ends: 1492 [2022-07-12 11:02:36,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 192 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=1875, Unknown=0, NotChecked=0, Total=2070 [2022-07-12 11:02:36,030 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 210 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 2749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 679 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:36,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1047 Invalid, 2749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1938 Invalid, 0 Unknown, 679 Unchecked, 1.0s Time] [2022-07-12 11:02:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2022-07-12 11:02:36,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1476. [2022-07-12 11:02:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 889 states have (on average 1.1496062992125984) internal successors, (1022), 893 states have internal predecessors, (1022), 480 states have call successors, (480), 96 states have call predecessors, (480), 106 states have return successors, (652), 486 states have call predecessors, (652), 476 states have call successors, (652) [2022-07-12 11:02:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 2154 transitions. [2022-07-12 11:02:36,136 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 2154 transitions. Word has length 170 [2022-07-12 11:02:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:36,136 INFO L495 AbstractCegarLoop]: Abstraction has 1476 states and 2154 transitions. [2022-07-12 11:02:36,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 4.105263157894737) internal successors, (78), 16 states have internal predecessors, (78), 7 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2022-07-12 11:02:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 2154 transitions. [2022-07-12 11:02:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-12 11:02:36,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:36,140 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:36,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:36,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 11:02:36,355 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:36,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:36,356 INFO L85 PathProgramCache]: Analyzing trace with hash 906081946, now seen corresponding path program 1 times [2022-07-12 11:02:36,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:36,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631220949] [2022-07-12 11:02:36,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:36,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:02:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:02:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:02:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:02:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:02:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:02:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:02:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:02:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:02:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:02:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:02:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:02:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:02:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:02:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 11:02:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-07-12 11:02:36,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:36,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631220949] [2022-07-12 11:02:36,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631220949] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:36,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436708532] [2022-07-12 11:02:36,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:36,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:36,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:36,807 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:36,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 11:02:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:37,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 2859 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-12 11:02:37,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:37,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:02:37,383 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-12 11:02:38,020 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 30 treesize of output 18 [2022-07-12 11:02:38,022 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-12 11:02:38,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:38,045 INFO L356 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2022-07-12 11:02:38,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 39 [2022-07-12 11:02:51,205 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 11:02:51,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 29 [2022-07-12 11:02:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 31 proven. 127 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-07-12 11:02:51,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:56,875 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 58 treesize of output 46 [2022-07-12 11:02:56,976 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 46 treesize of output 40 [2022-07-12 11:02:59,015 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.offset|)) 0)) (<= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.offset|) 18446744073709551616) 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (v_ArrVal_2005 Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (or (<= (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| (store (store (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.offset|)) (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|) v_ArrVal_2005)) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.offset|) 18446744073709551616) 0) (= |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|))) (forall ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (v_ArrVal_2005 Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.offset|)) (.cse0 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|))) (let ((.cse1 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| (store (store (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| .cse2) .cse0 v_ArrVal_2005)) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.offset|) 18446744073709551616))) (or (= .cse0 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.offset|)) (<= .cse1 0) (not (= (mod .cse2 18446744073709551616) .cse1))))))) is different from false [2022-07-12 11:02:59,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436708532] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:59,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:02:59,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 28] total 45 [2022-07-12 11:02:59,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171844758] [2022-07-12 11:02:59,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:59,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-12 11:02:59,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:59,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-12 11:02:59,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=3298, Unknown=1, NotChecked=116, Total=3660 [2022-07-12 11:02:59,038 INFO L87 Difference]: Start difference. First operand 1476 states and 2154 transitions. Second operand has 45 states, 38 states have (on average 3.6052631578947367) internal successors, (137), 38 states have internal predecessors, (137), 18 states have call successors, (53), 10 states have call predecessors, (53), 13 states have return successors, (52), 13 states have call predecessors, (52), 17 states have call successors, (52) [2022-07-12 11:03:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:09,679 INFO L93 Difference]: Finished difference Result 1663 states and 2394 transitions. [2022-07-12 11:03:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-12 11:03:09,680 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 38 states have (on average 3.6052631578947367) internal successors, (137), 38 states have internal predecessors, (137), 18 states have call successors, (53), 10 states have call predecessors, (53), 13 states have return successors, (52), 13 states have call predecessors, (52), 17 states have call successors, (52) Word has length 172 [2022-07-12 11:03:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:09,690 INFO L225 Difference]: With dead ends: 1663 [2022-07-12 11:03:09,690 INFO L226 Difference]: Without dead ends: 1527 [2022-07-12 11:03:09,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 290 SyntacticMatches, 11 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2631 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=790, Invalid=8525, Unknown=1, NotChecked=190, Total=9506 [2022-07-12 11:03:09,692 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 455 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 4108 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 6687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 4108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2109 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:09,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1658 Invalid, 6687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 4108 Invalid, 0 Unknown, 2109 Unchecked, 2.3s Time] [2022-07-12 11:03:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2022-07-12 11:03:09,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1484. [2022-07-12 11:03:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 895 states have (on average 1.146368715083799) internal successors, (1026), 900 states have internal predecessors, (1026), 478 states have call successors, (478), 99 states have call predecessors, (478), 110 states have return successors, (650), 484 states have call predecessors, (650), 474 states have call successors, (650) [2022-07-12 11:03:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 2154 transitions. [2022-07-12 11:03:09,806 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 2154 transitions. Word has length 172 [2022-07-12 11:03:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:09,807 INFO L495 AbstractCegarLoop]: Abstraction has 1484 states and 2154 transitions. [2022-07-12 11:03:09,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 38 states have (on average 3.6052631578947367) internal successors, (137), 38 states have internal predecessors, (137), 18 states have call successors, (53), 10 states have call predecessors, (53), 13 states have return successors, (52), 13 states have call predecessors, (52), 17 states have call successors, (52) [2022-07-12 11:03:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 2154 transitions. [2022-07-12 11:03:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-12 11:03:09,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:09,811 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:09,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:10,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:10,036 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:10,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1618034191, now seen corresponding path program 1 times [2022-07-12 11:03:10,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:10,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112242426] [2022-07-12 11:03:10,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:10,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:03:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:03:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:03:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:03:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:03:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:03:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 11:03:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:03:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:03:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:03:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 11:03:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:03:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 11:03:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:03:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 11:03:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 11:03:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 11:03:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 36 proven. 11 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2022-07-12 11:03:10,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:10,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112242426] [2022-07-12 11:03:10,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112242426] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:10,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198369330] [2022-07-12 11:03:10,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:10,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:10,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:10,457 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:10,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-12 11:03:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 2912 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-12 11:03:10,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:10,908 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:03:10,909 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 11:03:11,100 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:03:11,100 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-12 11:03:11,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:11,550 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 11:03:11,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-07-12 11:03:11,592 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 11:03:11,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 11:03:11,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:03:11,707 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2193 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_2193))) is different from true [2022-07-12 11:03:11,721 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-12 11:03:11,722 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 28 treesize of output 35 [2022-07-12 11:03:11,728 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 18 treesize of output 14 [2022-07-12 11:03:11,761 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2194 (Array Int Int))) (= (store |c_old(#memory_int)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_2194) |c_#memory_int|)) is different from true [2022-07-12 11:03:11,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:03:11,767 WARN L855 $PredicateComparison]: unable to prove that (exists ((|save_byte_from_array_~storage#1.base| Int) (v_ArrVal_2195 (Array Int Int))) (= (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| v_ArrVal_2195) |c_#memory_int|)) is different from true [2022-07-12 11:03:11,778 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:03:11,778 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 17 treesize of output 23 [2022-07-12 11:03:11,781 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 8 treesize of output 6 [2022-07-12 11:03:12,886 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 131 proven. 144 refuted. 0 times theorem prover too weak. 71 trivial. 4 not checked. [2022-07-12 11:03:12,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:03:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2022-07-12 11:03:13,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198369330] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:03:13,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:03:13,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 32, 9] total 46 [2022-07-12 11:03:13,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010571469] [2022-07-12 11:03:13,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:03:13,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 11:03:13,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:13,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 11:03:13,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1651, Unknown=4, NotChecked=252, Total=2070 [2022-07-12 11:03:13,285 INFO L87 Difference]: Start difference. First operand 1484 states and 2154 transitions. Second operand has 46 states, 44 states have (on average 3.7954545454545454) internal successors, (167), 42 states have internal predecessors, (167), 14 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (51), 14 states have call predecessors, (51), 12 states have call successors, (51) [2022-07-12 11:03:14,464 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|save_byte_from_array_~storage#1.base| Int) (v_ArrVal_2195 (Array Int Int))) (= (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| v_ArrVal_2195) |c_#memory_int|)) (exists ((v_ArrVal_2193 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_2193)))) is different from true [2022-07-12 11:03:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:17,307 INFO L93 Difference]: Finished difference Result 3561 states and 5322 transitions. [2022-07-12 11:03:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-12 11:03:17,308 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 3.7954545454545454) internal successors, (167), 42 states have internal predecessors, (167), 14 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (51), 14 states have call predecessors, (51), 12 states have call successors, (51) Word has length 177 [2022-07-12 11:03:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:17,317 INFO L225 Difference]: With dead ends: 3561 [2022-07-12 11:03:17,317 INFO L226 Difference]: Without dead ends: 2768 [2022-07-12 11:03:17,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 351 SyntacticMatches, 30 SemanticMatches, 80 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2265 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=562, Invalid=5451, Unknown=9, NotChecked=620, Total=6642 [2022-07-12 11:03:17,321 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 579 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 4382 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 8506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 4382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3409 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:17,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1747 Invalid, 8506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 4382 Invalid, 0 Unknown, 3409 Unchecked, 2.7s Time] [2022-07-12 11:03:17,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2768 states. [2022-07-12 11:03:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2768 to 2238. [2022-07-12 11:03:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2238 states, 1320 states have (on average 1.1492424242424242) internal successors, (1517), 1320 states have internal predecessors, (1517), 779 states have call successors, (779), 129 states have call predecessors, (779), 138 states have return successors, (1012), 788 states have call predecessors, (1012), 775 states have call successors, (1012) [2022-07-12 11:03:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 3308 transitions. [2022-07-12 11:03:17,521 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 3308 transitions. Word has length 177 [2022-07-12 11:03:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:17,522 INFO L495 AbstractCegarLoop]: Abstraction has 2238 states and 3308 transitions. [2022-07-12 11:03:17,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 3.7954545454545454) internal successors, (167), 42 states have internal predecessors, (167), 14 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (51), 14 states have call predecessors, (51), 12 states have call successors, (51) [2022-07-12 11:03:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 3308 transitions. [2022-07-12 11:03:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-12 11:03:17,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:17,526 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:17,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:17,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:17,730 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:17,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:17,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1783237655, now seen corresponding path program 2 times [2022-07-12 11:03:17,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:17,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767239413] [2022-07-12 11:03:17,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:17,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:03:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:03:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:03:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:03:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:03:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:03:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 11:03:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:03:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:17,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:03:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:03:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 11:03:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:03:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 11:03:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 11:03:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 11:03:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 11:03:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 11:03:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2022-07-12 11:03:18,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:18,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767239413] [2022-07-12 11:03:18,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767239413] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:18,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114991862] [2022-07-12 11:03:18,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:03:18,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:18,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:18,069 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:18,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-12 11:03:19,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:03:19,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:03:19,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 2924 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:03:19,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-12 11:03:19,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:03:19,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114991862] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:19,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:03:19,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 13 [2022-07-12 11:03:19,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693133947] [2022-07-12 11:03:19,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:19,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:03:19,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:19,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:03:19,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:03:19,054 INFO L87 Difference]: Start difference. First operand 2238 states and 3308 transitions. Second operand has 9 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 11:03:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:19,307 INFO L93 Difference]: Finished difference Result 3313 states and 4915 transitions. [2022-07-12 11:03:19,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:03:19,307 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 181 [2022-07-12 11:03:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:19,316 INFO L225 Difference]: With dead ends: 3313 [2022-07-12 11:03:19,316 INFO L226 Difference]: Without dead ends: 2238 [2022-07-12 11:03:19,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:03:19,321 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 10 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:19,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1406 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:03:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2022-07-12 11:03:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2238. [2022-07-12 11:03:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2238 states, 1320 states have (on average 1.1492424242424242) internal successors, (1517), 1320 states have internal predecessors, (1517), 779 states have call successors, (779), 129 states have call predecessors, (779), 138 states have return successors, (974), 788 states have call predecessors, (974), 775 states have call successors, (974) [2022-07-12 11:03:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 3270 transitions. [2022-07-12 11:03:19,522 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 3270 transitions. Word has length 181 [2022-07-12 11:03:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:19,523 INFO L495 AbstractCegarLoop]: Abstraction has 2238 states and 3270 transitions. [2022-07-12 11:03:19,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 11:03:19,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 3270 transitions. [2022-07-12 11:03:19,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 11:03:19,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:19,528 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:19,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:19,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:19,743 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:19,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:19,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1874575422, now seen corresponding path program 3 times [2022-07-12 11:03:19,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:19,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260537762] [2022-07-12 11:03:19,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:19,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:03:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:03:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:03:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:03:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:03:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:03:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 11:03:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:03:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:03:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 11:03:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:03:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:03:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:03:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 11:03:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 11:03:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 11:03:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 11:03:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 20 proven. 33 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2022-07-12 11:03:20,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:20,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260537762] [2022-07-12 11:03:20,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260537762] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:20,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716816619] [2022-07-12 11:03:20,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 11:03:20,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:20,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:20,591 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:20,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-12 11:03:21,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 11:03:21,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:03:21,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 2409 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 11:03:21,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-07-12 11:03:29,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:03:29,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716816619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:29,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:03:29,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [26] total 33 [2022-07-12 11:03:29,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110734501] [2022-07-12 11:03:29,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:29,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:03:29,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:29,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:03:29,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=957, Unknown=1, NotChecked=0, Total=1056 [2022-07-12 11:03:29,402 INFO L87 Difference]: Start difference. First operand 2238 states and 3270 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 3 states have call successors, (26), 3 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 11:03:29,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:29,643 INFO L93 Difference]: Finished difference Result 3809 states and 5597 transitions. [2022-07-12 11:03:29,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:03:29,644 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 3 states have call successors, (26), 3 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 183 [2022-07-12 11:03:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:29,652 INFO L225 Difference]: With dead ends: 3809 [2022-07-12 11:03:29,652 INFO L226 Difference]: Without dead ends: 2464 [2022-07-12 11:03:29,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 221 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=98, Invalid=957, Unknown=1, NotChecked=0, Total=1056 [2022-07-12 11:03:29,656 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 6 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:29,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1051 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 130 Unchecked, 0.1s Time] [2022-07-12 11:03:29,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2022-07-12 11:03:29,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2452. [2022-07-12 11:03:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 1437 states have (on average 1.1162143354210161) internal successors, (1604), 1465 states have internal predecessors, (1604), 869 states have call successors, (869), 138 states have call predecessors, (869), 145 states have return successors, (1064), 848 states have call predecessors, (1064), 865 states have call successors, (1064) [2022-07-12 11:03:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3537 transitions. [2022-07-12 11:03:29,824 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3537 transitions. Word has length 183 [2022-07-12 11:03:29,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:29,825 INFO L495 AbstractCegarLoop]: Abstraction has 2452 states and 3537 transitions. [2022-07-12 11:03:29,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 3 states have call successors, (26), 3 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 11:03:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3537 transitions. [2022-07-12 11:03:29,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 11:03:29,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:29,829 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:29,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-12 11:03:30,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 11:03:30,054 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:30,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:30,054 INFO L85 PathProgramCache]: Analyzing trace with hash -174812420, now seen corresponding path program 1 times [2022-07-12 11:03:30,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:30,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19909822] [2022-07-12 11:03:30,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:30,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:03:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:03:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:03:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:03:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:03:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:03:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 11:03:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:03:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:03:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 11:03:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:03:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:03:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:03:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 11:03:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 11:03:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 11:03:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 11:03:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2022-07-12 11:03:30,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:30,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19909822] [2022-07-12 11:03:30,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19909822] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:30,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877494157] [2022-07-12 11:03:30,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:30,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:30,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:30,881 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:30,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-12 11:03:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:31,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 2932 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-12 11:03:31,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:31,348 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:03:31,348 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 11:03:31,610 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-12 11:03:31,658 INFO L356 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2022-07-12 11:03:31,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 33 [2022-07-12 11:03:32,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-12 11:03:32,203 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 39 treesize of output 23 [2022-07-12 11:03:32,258 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-07-12 11:03:32,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-07-12 11:03:32,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 11:03:32,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:03:32,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-07-12 11:03:32,703 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-12 11:03:32,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 11:03:32,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:03:32,836 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2752 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_2752))) is different from true [2022-07-12 11:03:32,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35