./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_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 0658a835d559c56129f1a85a00e9d3bbd205d66ef64b5c7d14ae72b3d1b496e0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:41:41,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:41:41,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:41:41,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:41:41,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:41:41,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:41:41,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:41:41,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:41:41,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:41:41,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:41:41,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:41:41,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:41:41,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:41:41,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:41:41,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:41:41,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:41:41,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:41:41,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:41:41,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:41:41,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:41:41,197 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:41:41,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:41:41,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:41:41,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:41:41,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:41:41,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:41:41,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:41:41,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:41:41,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:41:41,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:41:41,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:41:41,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:41:41,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:41:41,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:41:41,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:41:41,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:41:41,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:41:41,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:41:41,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:41:41,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:41:41,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:41:41,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:41:41,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:41:41,234 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:41:41,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:41:41,235 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:41:41,235 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:41:41,236 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:41:41,236 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:41:41,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:41:41,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:41:41,236 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:41:41,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:41:41,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:41:41,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:41:41,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:41:41,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:41:41,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:41:41,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:41:41,238 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:41:41,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:41:41,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:41:41,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:41:41,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:41:41,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:41:41,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:41:41,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:41:41,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:41:41,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:41:41,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:41:41,239 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:41:41,239 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:41:41,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:41:41,240 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 -> 0658a835d559c56129f1a85a00e9d3bbd205d66ef64b5c7d14ae72b3d1b496e0 [2022-07-13 22:41:41,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:41:41,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:41:41,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:41:41,412 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:41:41,413 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:41:41,414 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_lookup_harness.i [2022-07-13 22:41:41,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0713653c3/d8bab176fafa468cbc267b55477321c4/FLAG50366c335 [2022-07-13 22:41:42,017 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:41:42,017 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i [2022-07-13 22:41:42,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0713653c3/d8bab176fafa468cbc267b55477321c4/FLAG50366c335 [2022-07-13 22:41:42,483 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0713653c3/d8bab176fafa468cbc267b55477321c4 [2022-07-13 22:41:42,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:41:42,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:41:42,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:41:42,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:41:42,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:41:42,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:41:42" (1/1) ... [2022-07-13 22:41:42,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73bedab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:42, skipping insertion in model container [2022-07-13 22:41:42,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:41:42" (1/1) ... [2022-07-13 22:41:42,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:41:42,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:41:42,761 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_lookup_harness.i[4504,4517] [2022-07-13 22:41:42,767 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_lookup_harness.i[4564,4577] [2022-07-13 22:41:43,293 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,294 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,299 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,300 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,300 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,308 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,312 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,315 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,315 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,510 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:41:43,511 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:41:43,512 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:41:43,514 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:41:43,515 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:41:43,515 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:41:43,515 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:41:43,516 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:41:43,516 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:41:43,517 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:41:43,602 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:41:43,712 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,712 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:41:43,806 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:41:43,823 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_lookup_harness.i[4504,4517] [2022-07-13 22:41:43,825 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_lookup_harness.i[4564,4577] [2022-07-13 22:41:43,857 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,858 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,858 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,859 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,863 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,866 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,866 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,867 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,867 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,893 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:41:43,893 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:41:43,894 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:41:43,894 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:41:43,895 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:41:43,895 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:41:43,895 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:41:43,895 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:41:43,896 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:41:43,896 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:41:43,923 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:41:43,950 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,951 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:43,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:41:44,184 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:41:44,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:44 WrapperNode [2022-07-13 22:41:44,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:41:44,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:41:44,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:41:44,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:41:44,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:44" (1/1) ... [2022-07-13 22:41:44,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:44" (1/1) ... [2022-07-13 22:41:44,306 INFO L137 Inliner]: procedures = 691, calls = 2649, calls flagged for inlining = 58, calls inlined = 4, statements flattened = 829 [2022-07-13 22:41:44,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:41:44,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:41:44,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:41:44,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:41:44,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:44" (1/1) ... [2022-07-13 22:41:44,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:44" (1/1) ... [2022-07-13 22:41:44,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:44" (1/1) ... [2022-07-13 22:41:44,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:44" (1/1) ... [2022-07-13 22:41:44,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:44" (1/1) ... [2022-07-13 22:41:44,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:44" (1/1) ... [2022-07-13 22:41:44,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:44" (1/1) ... [2022-07-13 22:41:44,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:41:44,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:41:44,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:41:44,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:41:44,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:44" (1/1) ... [2022-07-13 22:41:44,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:41:44,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:44,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 22:41:44,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 22:41:44,439 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-13 22:41:44,439 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-13 22:41:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:41:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:41:44,440 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:41:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:41:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_bounded [2022-07-13 22:41:44,441 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_bounded [2022-07-13 22:41:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:41:44,441 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:41:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:41:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:41:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2022-07-13 22:41:44,443 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2022-07-13 22:41:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:41:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:41:44,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:41:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:41:44,443 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:41:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-13 22:41:44,444 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-13 22:41:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:41:44,444 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:41:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:41:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:41:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:41:44,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:41:44,445 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-13 22:41:44,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-13 22:41:44,445 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_compare_lookup [2022-07-13 22:41:44,446 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_compare_lookup [2022-07-13 22:41:44,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:41:44,702 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:41:44,704 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:41:45,307 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:41:45,314 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:41:45,315 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 22:41:45,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:41:45 BoogieIcfgContainer [2022-07-13 22:41:45,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:41:45,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:41:45,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:41:45,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:41:45,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:41:42" (1/3) ... [2022-07-13 22:41:45,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77371747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:41:45, skipping insertion in model container [2022-07-13 22:41:45,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:44" (2/3) ... [2022-07-13 22:41:45,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77371747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:41:45, skipping insertion in model container [2022-07-13 22:41:45,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:41:45" (3/3) ... [2022-07-13 22:41:45,324 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_compare_lookup_harness.i [2022-07-13 22:41:45,337 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:41:45,337 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:41:45,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:41:45,391 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@1b80d496, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@431093c3 [2022-07-13 22:41:45,392 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:41:45,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 80 states have (on average 1.2625) internal successors, (101), 81 states have internal predecessors, (101), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-13 22:41:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 22:41:45,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:45,407 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:41:45,408 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:45,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:45,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1628753842, now seen corresponding path program 1 times [2022-07-13 22:41:45,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:45,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604117686] [2022-07-13 22:41:45,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:45,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:45,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:45,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:41:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:45,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:41:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:45,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:41:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:45,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:41:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:45,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:41:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:45,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:41:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:41:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:45,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:41:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:41:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:41:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 22:41:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:41:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:41:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:41:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-13 22:41:46,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:46,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604117686] [2022-07-13 22:41:46,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604117686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:41:46,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:41:46,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 22:41:46,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324969735] [2022-07-13 22:41:46,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:41:46,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:41:46,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:46,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:41:46,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:41:46,106 INFO L87 Difference]: Start difference. First operand has 133 states, 80 states have (on average 1.2625) internal successors, (101), 81 states have internal predecessors, (101), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:41:46,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:46,424 INFO L93 Difference]: Finished difference Result 265 states and 391 transitions. [2022-07-13 22:41:46,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 22:41:46,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 95 [2022-07-13 22:41:46,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:46,433 INFO L225 Difference]: With dead ends: 265 [2022-07-13 22:41:46,433 INFO L226 Difference]: Without dead ends: 130 [2022-07-13 22:41:46,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:41:46,439 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 63 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:46,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 201 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:41:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-13 22:41:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-07-13 22:41:46,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 76 states have internal predecessors, (92), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-07-13 22:41:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2022-07-13 22:41:46,472 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 95 [2022-07-13 22:41:46,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:46,473 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2022-07-13 22:41:46,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:41:46,473 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2022-07-13 22:41:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 22:41:46,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:46,476 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:41:46,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:41:46,477 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:46,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1573250628, now seen corresponding path program 1 times [2022-07-13 22:41:46,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:46,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473156453] [2022-07-13 22:41:46,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:46,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:41:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:41:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:41:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:41:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:41:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:41:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:41:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:41:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:41:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:41:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 22:41:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:41:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:41:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:41:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 22:41:46,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:46,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473156453] [2022-07-13 22:41:46,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473156453] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:46,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868968285] [2022-07-13 22:41:46,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:46,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:46,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:46,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:41:46,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 22:41:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 2650 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 22:41:47,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:41:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 22:41:47,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:41:47,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868968285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:41:47,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:41:47,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-13 22:41:47,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231304920] [2022-07-13 22:41:47,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:41:47,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:41:47,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:47,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:41:47,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:41:47,316 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:41:47,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:47,483 INFO L93 Difference]: Finished difference Result 250 states and 347 transitions. [2022-07-13 22:41:47,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:41:47,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 95 [2022-07-13 22:41:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:47,489 INFO L225 Difference]: With dead ends: 250 [2022-07-13 22:41:47,491 INFO L226 Difference]: Without dead ends: 130 [2022-07-13 22:41:47,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 119 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-13 22:41:47,496 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 187 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:47,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 366 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:41:47,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-13 22:41:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-13 22:41:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 41 states have call successors, (41), 10 states have call predecessors, (41), 11 states have return successors, (48), 40 states have call predecessors, (48), 40 states have call successors, (48) [2022-07-13 22:41:47,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 183 transitions. [2022-07-13 22:41:47,516 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 183 transitions. Word has length 95 [2022-07-13 22:41:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:47,517 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 183 transitions. [2022-07-13 22:41:47,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:41:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 183 transitions. [2022-07-13 22:41:47,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-13 22:41:47,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:47,522 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:41:47,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 22:41:47,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:47,736 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:47,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:47,736 INFO L85 PathProgramCache]: Analyzing trace with hash -513109833, now seen corresponding path program 1 times [2022-07-13 22:41:47,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:47,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662654909] [2022-07-13 22:41:47,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:47,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:41:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:41:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:41:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:47,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:41:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:41:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:41:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:41:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:41:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:41:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:41:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:41:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:41:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:41:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:41:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-13 22:41:48,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:48,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662654909] [2022-07-13 22:41:48,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662654909] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:48,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345608062] [2022-07-13 22:41:48,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:48,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:48,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:48,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:41:48,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 22:41:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 2655 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:41:48,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:41:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 22:41:48,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:41:48,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345608062] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:41:48,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:41:48,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2022-07-13 22:41:48,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567280070] [2022-07-13 22:41:48,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:41:48,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:41:48,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:48,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:41:48,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:41:48,643 INFO L87 Difference]: Start difference. First operand 130 states and 183 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-13 22:41:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:48,939 INFO L93 Difference]: Finished difference Result 210 states and 301 transitions. [2022-07-13 22:41:48,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:41:48,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 97 [2022-07-13 22:41:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:48,941 INFO L225 Difference]: With dead ends: 210 [2022-07-13 22:41:48,941 INFO L226 Difference]: Without dead ends: 130 [2022-07-13 22:41:48,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-07-13 22:41:48,942 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 204 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:48,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 636 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:41:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-13 22:41:48,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-13 22:41:48,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 41 states have call successors, (41), 10 states have call predecessors, (41), 11 states have return successors, (45), 40 states have call predecessors, (45), 40 states have call successors, (45) [2022-07-13 22:41:48,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 180 transitions. [2022-07-13 22:41:48,953 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 180 transitions. Word has length 97 [2022-07-13 22:41:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:48,956 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 180 transitions. [2022-07-13 22:41:48,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-13 22:41:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 180 transitions. [2022-07-13 22:41:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 22:41:48,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:48,958 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:41:48,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 22:41:49,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-13 22:41:49,197 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:49,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:49,198 INFO L85 PathProgramCache]: Analyzing trace with hash -199598313, now seen corresponding path program 2 times [2022-07-13 22:41:49,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:49,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546821298] [2022-07-13 22:41:49,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:41:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:41:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:41:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:41:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:41:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:41:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:41:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:41:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:41:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:41:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:41:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:41:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:41:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:41:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-13 22:41:49,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:49,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546821298] [2022-07-13 22:41:49,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546821298] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:49,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367838472] [2022-07-13 22:41:49,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:41:49,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:49,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:49,464 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:41:49,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 22:41:49,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 22:41:49,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:41:49,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 2337 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 22:41:49,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:41:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-13 22:41:49,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:41:49,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367838472] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:41:49,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:41:49,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-13 22:41:49,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162714815] [2022-07-13 22:41:49,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:41:49,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:41:49,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:49,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:41:49,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:41:49,852 INFO L87 Difference]: Start difference. First operand 130 states and 180 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:41:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:49,918 INFO L93 Difference]: Finished difference Result 142 states and 201 transitions. [2022-07-13 22:41:49,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:41:49,918 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2022-07-13 22:41:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:49,920 INFO L225 Difference]: With dead ends: 142 [2022-07-13 22:41:49,920 INFO L226 Difference]: Without dead ends: 140 [2022-07-13 22:41:49,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 123 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-13 22:41:49,921 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 16 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:49,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1200 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:41:49,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-13 22:41:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2022-07-13 22:41:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 86 states have internal predecessors, (100), 42 states have call successors, (42), 11 states have call predecessors, (42), 13 states have return successors, (56), 41 states have call predecessors, (56), 41 states have call successors, (56) [2022-07-13 22:41:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 198 transitions. [2022-07-13 22:41:49,933 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 198 transitions. Word has length 101 [2022-07-13 22:41:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:49,933 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 198 transitions. [2022-07-13 22:41:49,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:41:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 198 transitions. [2022-07-13 22:41:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 22:41:49,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:49,935 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:41:49,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 22:41:50,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:50,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:50,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:50,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1826692575, now seen corresponding path program 1 times [2022-07-13 22:41:50,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:50,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780479752] [2022-07-13 22:41:50,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:50,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:41:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:41:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:41:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:41:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:41:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:41:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:41:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:41:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:41:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:41:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:41:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:41:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:41:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:41:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-13 22:41:50,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:50,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780479752] [2022-07-13 22:41:50,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780479752] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:50,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495982629] [2022-07-13 22:41:50,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:50,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:50,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:50,438 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:41:50,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 22:41:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:50,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 2674 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:41:50,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:41:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-13 22:41:50,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:41:50,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495982629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:41:50,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:41:50,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-13 22:41:50,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548216356] [2022-07-13 22:41:50,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:41:50,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:41:50,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:50,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:41:50,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:41:50,906 INFO L87 Difference]: Start difference. First operand 139 states and 198 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-13 22:41:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:51,164 INFO L93 Difference]: Finished difference Result 272 states and 404 transitions. [2022-07-13 22:41:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:41:51,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 101 [2022-07-13 22:41:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:51,167 INFO L225 Difference]: With dead ends: 272 [2022-07-13 22:41:51,167 INFO L226 Difference]: Without dead ends: 168 [2022-07-13 22:41:51,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 125 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-13 22:41:51,168 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 249 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:51,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 624 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:41:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-13 22:41:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-13 22:41:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 100 states have internal predecessors, (119), 56 states have call successors, (56), 12 states have call predecessors, (56), 14 states have return successors, (74), 55 states have call predecessors, (74), 55 states have call successors, (74) [2022-07-13 22:41:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2022-07-13 22:41:51,184 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 101 [2022-07-13 22:41:51,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:51,185 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2022-07-13 22:41:51,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-13 22:41:51,185 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2022-07-13 22:41:51,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-13 22:41:51,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:51,186 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2022-07-13 22:41:51,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 22:41:51,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:51,404 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:51,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:51,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1515977756, now seen corresponding path program 1 times [2022-07-13 22:41:51,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:51,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651373394] [2022-07-13 22:41:51,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:51,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:41:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:41:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:41:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:41:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:41:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:41:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:41:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:41:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:41:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:41:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:41:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:41:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:41:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:41:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-13 22:41:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:51,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651373394] [2022-07-13 22:41:51,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651373394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:41:51,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:41:51,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:41:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674652175] [2022-07-13 22:41:51,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:41:51,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:41:51,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:51,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:41:51,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:41:51,717 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:41:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:52,274 INFO L93 Difference]: Finished difference Result 181 states and 264 transitions. [2022-07-13 22:41:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:41:52,275 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2022-07-13 22:41:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:52,276 INFO L225 Difference]: With dead ends: 181 [2022-07-13 22:41:52,276 INFO L226 Difference]: Without dead ends: 179 [2022-07-13 22:41:52,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:41:52,277 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 80 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:52,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 528 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:41:52,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-13 22:41:52,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2022-07-13 22:41:52,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 100 states have (on average 1.22) internal successors, (122), 103 states have internal predecessors, (122), 58 states have call successors, (58), 13 states have call predecessors, (58), 15 states have return successors, (76), 57 states have call predecessors, (76), 57 states have call successors, (76) [2022-07-13 22:41:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 256 transitions. [2022-07-13 22:41:52,317 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 256 transitions. Word has length 103 [2022-07-13 22:41:52,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:52,318 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 256 transitions. [2022-07-13 22:41:52,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:41:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 256 transitions. [2022-07-13 22:41:52,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-13 22:41:52,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:52,322 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:41:52,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 22:41:52,322 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:52,322 INFO L85 PathProgramCache]: Analyzing trace with hash 101250906, now seen corresponding path program 1 times [2022-07-13 22:41:52,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:52,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556980749] [2022-07-13 22:41:52,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:52,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:41:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:41:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:41:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:41:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:41:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:41:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:41:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:41:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:41:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:41:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:41:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:41:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:41:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:41:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 22:41:52,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:52,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556980749] [2022-07-13 22:41:52,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556980749] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:52,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056682596] [2022-07-13 22:41:52,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:52,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:52,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:52,732 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:41:52,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 22:41:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:53,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 2682 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-13 22:41:53,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:41:53,146 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-13 22:41:53,410 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-13 22:41:53,410 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 40 treesize of output 35 [2022-07-13 22:41:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 48 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 22:41:59,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:01,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset| Int) (v_ArrVal_490 Int)) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base|) |ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|)) (+ |ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset| 8) v_ArrVal_490)) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616)))) is different from false [2022-07-13 22:42:01,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056682596] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:01,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:42:01,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 25 [2022-07-13 22:42:01,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536489389] [2022-07-13 22:42:01,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:01,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 22:42:01,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:01,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 22:42:01,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=753, Unknown=1, NotChecked=56, Total=930 [2022-07-13 22:42:01,265 INFO L87 Difference]: Start difference. First operand 174 states and 256 transitions. Second operand has 25 states, 24 states have (on average 3.875) internal successors, (93), 22 states have internal predecessors, (93), 9 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (29), 8 states have call predecessors, (29), 7 states have call successors, (29) [2022-07-13 22:42:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:03,371 INFO L93 Difference]: Finished difference Result 443 states and 678 transitions. [2022-07-13 22:42:03,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 22:42:03,372 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.875) internal successors, (93), 22 states have internal predecessors, (93), 9 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (29), 8 states have call predecessors, (29), 7 states have call successors, (29) Word has length 107 [2022-07-13 22:42:03,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:03,377 INFO L225 Difference]: With dead ends: 443 [2022-07-13 22:42:03,378 INFO L226 Difference]: Without dead ends: 322 [2022-07-13 22:42:03,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 175 SyntacticMatches, 21 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=250, Invalid=1474, Unknown=2, NotChecked=80, Total=1806 [2022-07-13 22:42:03,379 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 213 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 843 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:03,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 908 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1351 Invalid, 0 Unknown, 843 Unchecked, 1.0s Time] [2022-07-13 22:42:03,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-07-13 22:42:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 265. [2022-07-13 22:42:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 157 states have (on average 1.21656050955414) internal successors, (191), 162 states have internal predecessors, (191), 85 states have call successors, (85), 19 states have call predecessors, (85), 22 states have return successors, (118), 83 states have call predecessors, (118), 84 states have call successors, (118) [2022-07-13 22:42:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 394 transitions. [2022-07-13 22:42:03,421 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 394 transitions. Word has length 107 [2022-07-13 22:42:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:03,422 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 394 transitions. [2022-07-13 22:42:03,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.875) internal successors, (93), 22 states have internal predecessors, (93), 9 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (29), 8 states have call predecessors, (29), 7 states have call successors, (29) [2022-07-13 22:42:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 394 transitions. [2022-07-13 22:42:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-13 22:42:03,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:03,426 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-13 22:42:03,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 22:42:03,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:03,650 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:03,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:03,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1582523535, now seen corresponding path program 1 times [2022-07-13 22:42:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:03,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544478297] [2022-07-13 22:42:03,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:03,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:03,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:03,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:03,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:03,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:03,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:42:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:03,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:03,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:42:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:03,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:42:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:42:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 22:42:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:42:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:42:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 22:42:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:42:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-13 22:42:04,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:04,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544478297] [2022-07-13 22:42:04,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544478297] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:04,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095450399] [2022-07-13 22:42:04,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:04,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:04,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:04,101 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:42:04,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 22:42:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 2748 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:42:04,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-13 22:42:04,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:42:04,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095450399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:04,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:42:04,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 21 [2022-07-13 22:42:04,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126500357] [2022-07-13 22:42:04,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:04,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:42:04,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:04,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:42:04,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:42:04,598 INFO L87 Difference]: Start difference. First operand 265 states and 394 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-13 22:42:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:04,725 INFO L93 Difference]: Finished difference Result 460 states and 708 transitions. [2022-07-13 22:42:04,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:42:04,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 118 [2022-07-13 22:42:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:04,728 INFO L225 Difference]: With dead ends: 460 [2022-07-13 22:42:04,728 INFO L226 Difference]: Without dead ends: 270 [2022-07-13 22:42:04,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:42:04,731 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 12 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:04,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1314 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:42:04,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-13 22:42:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-07-13 22:42:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 161 states have (on average 1.2111801242236024) internal successors, (195), 167 states have internal predecessors, (195), 85 states have call successors, (85), 19 states have call predecessors, (85), 23 states have return successors, (135), 83 states have call predecessors, (135), 84 states have call successors, (135) [2022-07-13 22:42:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 415 transitions. [2022-07-13 22:42:04,755 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 415 transitions. Word has length 118 [2022-07-13 22:42:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:04,755 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 415 transitions. [2022-07-13 22:42:04,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-13 22:42:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 415 transitions. [2022-07-13 22:42:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-13 22:42:04,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:04,758 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:42:04,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 22:42:04,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:04,978 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:04,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:04,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1705417372, now seen corresponding path program 1 times [2022-07-13 22:42:04,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:04,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537354872] [2022-07-13 22:42:04,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:04,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:42:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:42:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:42:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:42:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:42:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:42:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:42:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:42:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-13 22:42:05,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:05,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537354872] [2022-07-13 22:42:05,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537354872] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:05,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388530114] [2022-07-13 22:42:05,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:05,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:05,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:05,228 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:42:05,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 22:42:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 2691 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-13 22:42:05,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:05,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:42:05,820 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 22:42:05,820 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 40 treesize of output 35 [2022-07-13 22:42:06,242 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 66 treesize of output 42 [2022-07-13 22:42:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 22:42:06,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:06,914 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:42:06,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-13 22:42:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-13 22:42:06,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388530114] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:42:06,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:42:06,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 11] total 27 [2022-07-13 22:42:06,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034805664] [2022-07-13 22:42:06,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:06,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 22:42:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:06,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 22:42:06,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2022-07-13 22:42:06,935 INFO L87 Difference]: Start difference. First operand 270 states and 415 transitions. Second operand has 27 states, 26 states have (on average 4.0) internal successors, (104), 23 states have internal predecessors, (104), 11 states have call successors, (43), 9 states have call predecessors, (43), 7 states have return successors, (39), 10 states have call predecessors, (39), 11 states have call successors, (39) [2022-07-13 22:42:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:09,823 INFO L93 Difference]: Finished difference Result 705 states and 1124 transitions. [2022-07-13 22:42:09,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-13 22:42:09,829 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.0) internal successors, (104), 23 states have internal predecessors, (104), 11 states have call successors, (43), 9 states have call predecessors, (43), 7 states have return successors, (39), 10 states have call predecessors, (39), 11 states have call successors, (39) Word has length 107 [2022-07-13 22:42:09,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:09,836 INFO L225 Difference]: With dead ends: 705 [2022-07-13 22:42:09,836 INFO L226 Difference]: Without dead ends: 546 [2022-07-13 22:42:09,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 222 SyntacticMatches, 16 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=458, Invalid=2841, Unknown=7, NotChecked=0, Total=3306 [2022-07-13 22:42:09,840 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 500 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 2672 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 4049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 2672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 936 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:09,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 672 Invalid, 4049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 2672 Invalid, 0 Unknown, 936 Unchecked, 1.9s Time] [2022-07-13 22:42:09,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-13 22:42:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 439. [2022-07-13 22:42:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 269 states have (on average 1.2230483271375465) internal successors, (329), 277 states have internal predecessors, (329), 137 states have call successors, (137), 26 states have call predecessors, (137), 32 states have return successors, (213), 135 states have call predecessors, (213), 136 states have call successors, (213) [2022-07-13 22:42:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 679 transitions. [2022-07-13 22:42:09,890 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 679 transitions. Word has length 107 [2022-07-13 22:42:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:09,890 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 679 transitions. [2022-07-13 22:42:09,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.0) internal successors, (104), 23 states have internal predecessors, (104), 11 states have call successors, (43), 9 states have call predecessors, (43), 7 states have return successors, (39), 10 states have call predecessors, (39), 11 states have call successors, (39) [2022-07-13 22:42:09,891 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 679 transitions. [2022-07-13 22:42:09,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-13 22:42:09,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:09,892 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:42:09,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 22:42:10,112 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-13 22:42:10,113 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:10,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1355654111, now seen corresponding path program 1 times [2022-07-13 22:42:10,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:10,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587951363] [2022-07-13 22:42:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:10,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:42:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:42:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:42:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:42:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:42:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:42:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:42:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:42:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-13 22:42:10,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:10,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587951363] [2022-07-13 22:42:10,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587951363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:10,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:10,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 22:42:10,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364539946] [2022-07-13 22:42:10,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:10,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 22:42:10,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:10,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 22:42:10,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:42:10,408 INFO L87 Difference]: Start difference. First operand 439 states and 679 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:42:11,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:11,096 INFO L93 Difference]: Finished difference Result 480 states and 752 transitions. [2022-07-13 22:42:11,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 22:42:11,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2022-07-13 22:42:11,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:11,099 INFO L225 Difference]: With dead ends: 480 [2022-07-13 22:42:11,099 INFO L226 Difference]: Without dead ends: 478 [2022-07-13 22:42:11,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:42:11,100 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 152 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:11,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 622 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:42:11,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-07-13 22:42:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 447. [2022-07-13 22:42:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 276 states have (on average 1.2173913043478262) internal successors, (336), 285 states have internal predecessors, (336), 137 states have call successors, (137), 26 states have call predecessors, (137), 33 states have return successors, (236), 135 states have call predecessors, (236), 136 states have call successors, (236) [2022-07-13 22:42:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 709 transitions. [2022-07-13 22:42:11,160 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 709 transitions. Word has length 109 [2022-07-13 22:42:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:11,161 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 709 transitions. [2022-07-13 22:42:11,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:42:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 709 transitions. [2022-07-13 22:42:11,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-13 22:42:11,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:11,163 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:42:11,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 22:42:11,163 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:11,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:11,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2056718689, now seen corresponding path program 1 times [2022-07-13 22:42:11,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:11,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735609671] [2022-07-13 22:42:11,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:11,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:42:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:42:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:42:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:42:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:42:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:42:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:42:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:42:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-13 22:42:11,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:11,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735609671] [2022-07-13 22:42:11,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735609671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:11,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:11,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-13 22:42:11,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157341690] [2022-07-13 22:42:11,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:11,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 22:42:11,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:11,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 22:42:11,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:42:11,490 INFO L87 Difference]: Start difference. First operand 447 states and 709 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:42:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:12,432 INFO L93 Difference]: Finished difference Result 467 states and 733 transitions. [2022-07-13 22:42:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 22:42:12,432 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2022-07-13 22:42:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:12,435 INFO L225 Difference]: With dead ends: 467 [2022-07-13 22:42:12,435 INFO L226 Difference]: Without dead ends: 465 [2022-07-13 22:42:12,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2022-07-13 22:42:12,437 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 168 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:12,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 724 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 22:42:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-07-13 22:42:12,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 435. [2022-07-13 22:42:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 266 states have (on average 1.2255639097744362) internal successors, (326), 273 states have internal predecessors, (326), 137 states have call successors, (137), 26 states have call predecessors, (137), 31 states have return successors, (212), 135 states have call predecessors, (212), 136 states have call successors, (212) [2022-07-13 22:42:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 675 transitions. [2022-07-13 22:42:12,468 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 675 transitions. Word has length 109 [2022-07-13 22:42:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:12,468 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 675 transitions. [2022-07-13 22:42:12,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:42:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 675 transitions. [2022-07-13 22:42:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-13 22:42:12,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:12,470 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:42:12,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 22:42:12,470 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:12,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:12,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1757380781, now seen corresponding path program 1 times [2022-07-13 22:42:12,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:12,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507612414] [2022-07-13 22:42:12,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:12,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:42:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:42:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:42:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:42:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:42:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:42:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:42:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:42:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-13 22:42:12,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:12,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507612414] [2022-07-13 22:42:12,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507612414] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:12,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669699721] [2022-07-13 22:42:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:12,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:12,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:12,777 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:42:12,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 22:42:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:13,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 2699 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 22:42:13,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 22:42:13,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:42:13,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669699721] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:13,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:42:13,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2022-07-13 22:42:13,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061090992] [2022-07-13 22:42:13,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:13,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:42:13,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:13,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:42:13,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:42:13,268 INFO L87 Difference]: Start difference. First operand 435 states and 675 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:42:13,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:13,424 INFO L93 Difference]: Finished difference Result 815 states and 1315 transitions. [2022-07-13 22:42:13,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:42:13,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 113 [2022-07-13 22:42:13,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:13,427 INFO L225 Difference]: With dead ends: 815 [2022-07-13 22:42:13,428 INFO L226 Difference]: Without dead ends: 442 [2022-07-13 22:42:13,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:42:13,430 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 15 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:13,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 621 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2022-07-13 22:42:13,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-07-13 22:42:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 435. [2022-07-13 22:42:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 266 states have (on average 1.2067669172932332) internal successors, (321), 273 states have internal predecessors, (321), 137 states have call successors, (137), 26 states have call predecessors, (137), 31 states have return successors, (212), 135 states have call predecessors, (212), 136 states have call successors, (212) [2022-07-13 22:42:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 670 transitions. [2022-07-13 22:42:13,458 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 670 transitions. Word has length 113 [2022-07-13 22:42:13,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:13,458 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 670 transitions. [2022-07-13 22:42:13,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:42:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 670 transitions. [2022-07-13 22:42:13,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 22:42:13,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:13,460 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-13 22:42:13,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 22:42:13,680 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,SelfDestructingSolverStorable11 [2022-07-13 22:42:13,680 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:13,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1375218206, now seen corresponding path program 1 times [2022-07-13 22:42:13,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:13,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404247615] [2022-07-13 22:42:13,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:42:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:42:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:42:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:42:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:42:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:42:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:42:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:42:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:42:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-13 22:42:14,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:14,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404247615] [2022-07-13 22:42:14,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404247615] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:14,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622512512] [2022-07-13 22:42:14,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:14,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:14,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:14,425 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:42:14,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 22:42:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:14,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 2749 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-13 22:42:14,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:15,116 INFO L356 Elim1Store]: treesize reduction 70, result has 26.3 percent of original size [2022-07-13 22:42:15,117 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 40 treesize of output 45 [2022-07-13 22:42:15,188 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 22:42:15,189 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 44 treesize of output 24 [2022-07-13 22:42:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 64 proven. 8 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 22:42:15,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:15,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, 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-13 22:42:15,632 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:42:15,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-13 22:42:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-13 22:42:15,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622512512] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:42:15,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:42:15,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13, 11] total 33 [2022-07-13 22:42:15,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149444880] [2022-07-13 22:42:15,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:15,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 22:42:15,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:15,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 22:42:15,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=961, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 22:42:15,670 INFO L87 Difference]: Start difference. First operand 435 states and 670 transitions. Second operand has 33 states, 30 states have (on average 3.966666666666667) internal successors, (119), 30 states have internal predecessors, (119), 16 states have call successors, (43), 8 states have call predecessors, (43), 10 states have return successors, (40), 13 states have call predecessors, (40), 16 states have call successors, (40) [2022-07-13 22:42:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:18,731 INFO L93 Difference]: Finished difference Result 908 states and 1439 transitions. [2022-07-13 22:42:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-13 22:42:18,732 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 3.966666666666667) internal successors, (119), 30 states have internal predecessors, (119), 16 states have call successors, (43), 8 states have call predecessors, (43), 10 states have return successors, (40), 13 states have call predecessors, (40), 16 states have call successors, (40) Word has length 120 [2022-07-13 22:42:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:18,737 INFO L225 Difference]: With dead ends: 908 [2022-07-13 22:42:18,737 INFO L226 Difference]: Without dead ends: 590 [2022-07-13 22:42:18,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 259 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=321, Invalid=2759, Unknown=0, NotChecked=0, Total=3080 [2022-07-13 22:42:18,741 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 467 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 3828 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 4874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 3828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 639 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:18,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 702 Invalid, 4874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 3828 Invalid, 0 Unknown, 639 Unchecked, 2.3s Time] [2022-07-13 22:42:18,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-07-13 22:42:18,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 500. [2022-07-13 22:42:18,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 299 states have (on average 1.1973244147157192) internal successors, (358), 305 states have internal predecessors, (358), 166 states have call successors, (166), 30 states have call predecessors, (166), 34 states have return successors, (254), 164 states have call predecessors, (254), 165 states have call successors, (254) [2022-07-13 22:42:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 778 transitions. [2022-07-13 22:42:18,777 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 778 transitions. Word has length 120 [2022-07-13 22:42:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:18,778 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 778 transitions. [2022-07-13 22:42:18,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 3.966666666666667) internal successors, (119), 30 states have internal predecessors, (119), 16 states have call successors, (43), 8 states have call predecessors, (43), 10 states have return successors, (40), 13 states have call predecessors, (40), 16 states have call successors, (40) [2022-07-13 22:42:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 778 transitions. [2022-07-13 22:42:18,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 22:42:18,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:18,780 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:42:18,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 22:42:18,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 22:42:18,996 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:18,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:18,996 INFO L85 PathProgramCache]: Analyzing trace with hash 961140430, now seen corresponding path program 1 times [2022-07-13 22:42:18,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:18,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662898048] [2022-07-13 22:42:18,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:18,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:42:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:42:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:42:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:42:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:42:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:42:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:42:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:42:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:42:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:42:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,223 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-13 22:42:19,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:19,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662898048] [2022-07-13 22:42:19,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662898048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:19,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:19,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:42:19,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749319925] [2022-07-13 22:42:19,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:19,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:42:19,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:19,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:42:19,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:42:19,225 INFO L87 Difference]: Start difference. First operand 500 states and 778 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-13 22:42:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:19,782 INFO L93 Difference]: Finished difference Result 514 states and 795 transitions. [2022-07-13 22:42:19,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:42:19,782 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 117 [2022-07-13 22:42:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:19,785 INFO L225 Difference]: With dead ends: 514 [2022-07-13 22:42:19,785 INFO L226 Difference]: Without dead ends: 512 [2022-07-13 22:42:19,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:42:19,786 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 78 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:19,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 518 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:42:19,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-07-13 22:42:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 508. [2022-07-13 22:42:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 302 states have (on average 1.195364238410596) internal successors, (361), 308 states have internal predecessors, (361), 170 states have call successors, (170), 31 states have call predecessors, (170), 35 states have return successors, (258), 168 states have call predecessors, (258), 169 states have call successors, (258) [2022-07-13 22:42:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 789 transitions. [2022-07-13 22:42:19,821 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 789 transitions. Word has length 117 [2022-07-13 22:42:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:19,821 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 789 transitions. [2022-07-13 22:42:19,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-13 22:42:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 789 transitions. [2022-07-13 22:42:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 22:42:19,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:19,823 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:42:19,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 22:42:19,824 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:19,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:19,825 INFO L85 PathProgramCache]: Analyzing trace with hash 622395683, now seen corresponding path program 1 times [2022-07-13 22:42:19,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:19,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733772609] [2022-07-13 22:42:19,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:19,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:19,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:42:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:42:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:42:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:42:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:42:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:42:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:42:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:42:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:42:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:42:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 22:42:20,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:20,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733772609] [2022-07-13 22:42:20,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733772609] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:20,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999809065] [2022-07-13 22:42:20,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:20,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:20,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:20,108 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:42:20,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 22:42:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:20,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 2716 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:42:20,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-13 22:42:20,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:42:20,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999809065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:20,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:42:20,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-13 22:42:20,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099045497] [2022-07-13 22:42:20,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:20,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:42:20,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:20,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:42:20,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:42:20,534 INFO L87 Difference]: Start difference. First operand 508 states and 789 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:42:20,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:20,710 INFO L93 Difference]: Finished difference Result 860 states and 1337 transitions. [2022-07-13 22:42:20,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:42:20,710 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 117 [2022-07-13 22:42:20,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:20,713 INFO L225 Difference]: With dead ends: 860 [2022-07-13 22:42:20,713 INFO L226 Difference]: Without dead ends: 513 [2022-07-13 22:42:20,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:42:20,715 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 11 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:20,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1291 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:42:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-13 22:42:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 508. [2022-07-13 22:42:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 302 states have (on average 1.195364238410596) internal successors, (361), 308 states have internal predecessors, (361), 170 states have call successors, (170), 31 states have call predecessors, (170), 35 states have return successors, (256), 168 states have call predecessors, (256), 169 states have call successors, (256) [2022-07-13 22:42:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 787 transitions. [2022-07-13 22:42:20,750 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 787 transitions. Word has length 117 [2022-07-13 22:42:20,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:20,750 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 787 transitions. [2022-07-13 22:42:20,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:42:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 787 transitions. [2022-07-13 22:42:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 22:42:20,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:20,753 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-13 22:42:20,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 22:42:20,967 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,SelfDestructingSolverStorable14 [2022-07-13 22:42:20,967 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:20,968 INFO L85 PathProgramCache]: Analyzing trace with hash -440949530, now seen corresponding path program 2 times [2022-07-13 22:42:20,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:20,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719833082] [2022-07-13 22:42:20,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:20,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:42:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:42:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:42:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:42:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:42:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:42:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:42:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:42:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:42:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:42:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-13 22:42:21,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:21,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719833082] [2022-07-13 22:42:21,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719833082] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:21,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866711033] [2022-07-13 22:42:21,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:42:21,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:21,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:21,668 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:42:21,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 22:42:22,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:42:22,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:42:22,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 2749 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-13 22:42:22,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:22,518 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-13 22:42:22,800 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 16 treesize of output 18 [2022-07-13 22:42:22,832 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 17 treesize of output 9 [2022-07-13 22:42:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 22:42:22,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:23,070 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1257 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base| v_ArrVal_1257) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|) 18446744073709551616) 0)) is different from false [2022-07-13 22:42:23,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866711033] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:23,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:42:23,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2022-07-13 22:42:23,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072433395] [2022-07-13 22:42:23,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:23,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 22:42:23,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:23,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 22:42:23,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=727, Unknown=1, NotChecked=54, Total=870 [2022-07-13 22:42:23,076 INFO L87 Difference]: Start difference. First operand 508 states and 787 transitions. Second operand has 27 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 11 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) [2022-07-13 22:42:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:25,972 INFO L93 Difference]: Finished difference Result 914 states and 1451 transitions. [2022-07-13 22:42:25,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 22:42:25,973 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 11 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) Word has length 120 [2022-07-13 22:42:25,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:25,976 INFO L225 Difference]: With dead ends: 914 [2022-07-13 22:42:25,976 INFO L226 Difference]: Without dead ends: 657 [2022-07-13 22:42:25,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 220 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=309, Invalid=2346, Unknown=1, NotChecked=100, Total=2756 [2022-07-13 22:42:25,978 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 387 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 3727 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 4566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 3727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:25,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 650 Invalid, 4566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 3727 Invalid, 0 Unknown, 302 Unchecked, 2.1s Time] [2022-07-13 22:42:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2022-07-13 22:42:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 533. [2022-07-13 22:42:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 317 states have (on average 1.1924290220820188) internal successors, (378), 321 states have internal predecessors, (378), 180 states have call successors, (180), 33 states have call predecessors, (180), 35 states have return successors, (268), 178 states have call predecessors, (268), 179 states have call successors, (268) [2022-07-13 22:42:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 826 transitions. [2022-07-13 22:42:26,020 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 826 transitions. Word has length 120 [2022-07-13 22:42:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:26,021 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 826 transitions. [2022-07-13 22:42:26,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 11 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) [2022-07-13 22:42:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 826 transitions. [2022-07-13 22:42:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 22:42:26,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:26,027 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:42:26,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 22:42:26,246 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,SelfDestructingSolverStorable15 [2022-07-13 22:42:26,247 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:26,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:26,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1937889046, now seen corresponding path program 1 times [2022-07-13 22:42:26,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:26,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671297809] [2022-07-13 22:42:26,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:26,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:42:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:42:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:42:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:42:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:42:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:42:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:42:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:42:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:42:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:42:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-13 22:42:26,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:26,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671297809] [2022-07-13 22:42:26,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671297809] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:26,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216931912] [2022-07-13 22:42:26,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:26,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:26,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:26,612 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:42:26,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 22:42:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:27,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 2714 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-13 22:42:27,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:27,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:42:27,291 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 22:42:27,291 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 40 treesize of output 35 [2022-07-13 22:42:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 45 proven. 22 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-13 22:42:28,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:28,560 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-13 22:42:28,589 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:42:28,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-13 22:42:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 22:42:28,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216931912] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:42:28,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:42:28,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 13] total 30 [2022-07-13 22:42:28,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657477050] [2022-07-13 22:42:28,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:28,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-13 22:42:28,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:28,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-13 22:42:28,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2022-07-13 22:42:28,608 INFO L87 Difference]: Start difference. First operand 533 states and 826 transitions. Second operand has 30 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 26 states have internal predecessors, (104), 11 states have call successors, (39), 9 states have call predecessors, (39), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-13 22:42:29,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:29,986 INFO L93 Difference]: Finished difference Result 1035 states and 1629 transitions. [2022-07-13 22:42:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-13 22:42:29,987 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 26 states have internal predecessors, (104), 11 states have call successors, (39), 9 states have call predecessors, (39), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) Word has length 121 [2022-07-13 22:42:29,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:29,990 INFO L225 Difference]: With dead ends: 1035 [2022-07-13 22:42:29,990 INFO L226 Difference]: Without dead ends: 700 [2022-07-13 22:42:29,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 243 SyntacticMatches, 25 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=254, Invalid=1726, Unknown=0, NotChecked=0, Total=1980 [2022-07-13 22:42:29,993 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 284 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 473 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:29,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1734 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1530 Invalid, 0 Unknown, 473 Unchecked, 1.0s Time] [2022-07-13 22:42:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-07-13 22:42:30,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 630. [2022-07-13 22:42:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 366 states have (on average 1.174863387978142) internal successors, (430), 372 states have internal predecessors, (430), 221 states have call successors, (221), 38 states have call predecessors, (221), 42 states have return successors, (312), 219 states have call predecessors, (312), 220 states have call successors, (312) [2022-07-13 22:42:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 963 transitions. [2022-07-13 22:42:30,070 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 963 transitions. Word has length 121 [2022-07-13 22:42:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:30,070 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 963 transitions. [2022-07-13 22:42:30,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 26 states have internal predecessors, (104), 11 states have call successors, (39), 9 states have call predecessors, (39), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-13 22:42:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 963 transitions. [2022-07-13 22:42:30,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-13 22:42:30,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:30,073 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:42:30,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 22:42:30,291 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,SelfDestructingSolverStorable16 [2022-07-13 22:42:30,292 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:30,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:30,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1718564348, now seen corresponding path program 2 times [2022-07-13 22:42:30,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:30,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667564652] [2022-07-13 22:42:30,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:30,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:42:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:42:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:42:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:42:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:42:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:42:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:42:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 22:42:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-13 22:42:30,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:30,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667564652] [2022-07-13 22:42:30,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667564652] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:30,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547187133] [2022-07-13 22:42:30,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:42:30,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:30,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:30,684 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:42:30,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 22:42:31,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:42:31,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:42:31,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 2726 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-13 22:42:31,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:31,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:42:31,933 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 22:42:31,933 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 42 treesize of output 37 [2022-07-13 22:42:32,413 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 73 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 22:42:32,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:34,654 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 29 treesize of output 17 [2022-07-13 22:42:34,753 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:42:34,754 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 31 treesize of output 26 [2022-07-13 22:42:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-13 22:42:34,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547187133] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:42:34,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:42:34,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 31 [2022-07-13 22:42:34,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139084779] [2022-07-13 22:42:34,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:34,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-13 22:42:34,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:34,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-13 22:42:34,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2022-07-13 22:42:34,770 INFO L87 Difference]: Start difference. First operand 630 states and 963 transitions. Second operand has 31 states, 29 states have (on average 4.275862068965517) internal successors, (124), 27 states have internal predecessors, (124), 11 states have call successors, (35), 9 states have call predecessors, (35), 8 states have return successors, (31), 9 states have call predecessors, (31), 11 states have call successors, (31) [2022-07-13 22:42:38,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:38,380 INFO L93 Difference]: Finished difference Result 1290 states and 2044 transitions. [2022-07-13 22:42:38,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-13 22:42:38,389 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 4.275862068965517) internal successors, (124), 27 states have internal predecessors, (124), 11 states have call successors, (35), 9 states have call predecessors, (35), 8 states have return successors, (31), 9 states have call predecessors, (31), 11 states have call successors, (31) Word has length 119 [2022-07-13 22:42:38,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:38,402 INFO L225 Difference]: With dead ends: 1290 [2022-07-13 22:42:38,415 INFO L226 Difference]: Without dead ends: 865 [2022-07-13 22:42:38,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 249 SyntacticMatches, 22 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=482, Invalid=2824, Unknown=0, NotChecked=0, Total=3306 [2022-07-13 22:42:38,418 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 311 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 4224 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 5107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 4224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 644 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:38,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1101 Invalid, 5107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 4224 Invalid, 0 Unknown, 644 Unchecked, 2.5s Time] [2022-07-13 22:42:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2022-07-13 22:42:38,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 800. [2022-07-13 22:42:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 456 states have (on average 1.1842105263157894) internal successors, (540), 465 states have internal predecessors, (540), 295 states have call successors, (295), 43 states have call predecessors, (295), 48 states have return successors, (421), 291 states have call predecessors, (421), 294 states have call successors, (421) [2022-07-13 22:42:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1256 transitions. [2022-07-13 22:42:38,507 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1256 transitions. Word has length 119 [2022-07-13 22:42:38,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:38,507 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1256 transitions. [2022-07-13 22:42:38,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 4.275862068965517) internal successors, (124), 27 states have internal predecessors, (124), 11 states have call successors, (35), 9 states have call predecessors, (35), 8 states have return successors, (31), 9 states have call predecessors, (31), 11 states have call successors, (31) [2022-07-13 22:42:38,508 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1256 transitions. [2022-07-13 22:42:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-13 22:42:38,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:38,511 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:42:38,532 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-13 22:42:38,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 22:42:38,727 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:38,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:38,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1501010925, now seen corresponding path program 3 times [2022-07-13 22:42:38,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:38,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890756851] [2022-07-13 22:42:38,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:38,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:38,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:38,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:39,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:39,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:39,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:42:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:39,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:39,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:42:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:39,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:42:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:39,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 22:42:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:39,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:42:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:39,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:42:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:42:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:39,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 22:42:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:39,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:42:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-13 22:42:39,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:39,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890756851] [2022-07-13 22:42:39,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890756851] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:39,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498905115] [2022-07-13 22:42:39,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 22:42:39,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:39,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:39,332 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-13 22:42:39,338 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-13 22:42:40,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 22:42:40,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:42:40,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 2489 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-13 22:42:40,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:41,453 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 77 proven. 13 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 22:42:41,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:41,881 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-13 22:42:41,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-13 22:42:41,887 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-13 22:42:41,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-07-13 22:42:41,914 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-13 22:42:41,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498905115] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:42:41,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:42:41,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 11] total 38 [2022-07-13 22:42:41,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642746726] [2022-07-13 22:42:41,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:41,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-13 22:42:41,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:41,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-13 22:42:41,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1290, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 22:42:41,919 INFO L87 Difference]: Start difference. First operand 800 states and 1256 transitions. Second operand has 38 states, 35 states have (on average 3.8857142857142857) internal successors, (136), 34 states have internal predecessors, (136), 11 states have call successors, (49), 6 states have call predecessors, (49), 8 states have return successors, (45), 9 states have call predecessors, (45), 11 states have call successors, (45) [2022-07-13 22:42:47,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:47,404 INFO L93 Difference]: Finished difference Result 1892 states and 3180 transitions. [2022-07-13 22:42:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-13 22:42:47,405 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 3.8857142857142857) internal successors, (136), 34 states have internal predecessors, (136), 11 states have call successors, (49), 6 states have call predecessors, (49), 8 states have return successors, (45), 9 states have call predecessors, (45), 11 states have call successors, (45) Word has length 126 [2022-07-13 22:42:47,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:47,410 INFO L225 Difference]: With dead ends: 1892 [2022-07-13 22:42:47,411 INFO L226 Difference]: Without dead ends: 1191 [2022-07-13 22:42:47,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 265 SyntacticMatches, 10 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1732 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=756, Invalid=6554, Unknown=0, NotChecked=0, Total=7310 [2022-07-13 22:42:47,415 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 457 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 5898 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 7279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 5898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1007 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:47,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1484 Invalid, 7279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 5898 Invalid, 0 Unknown, 1007 Unchecked, 3.3s Time] [2022-07-13 22:42:47,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2022-07-13 22:42:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1009. [2022-07-13 22:42:47,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 579 states have (on average 1.2072538860103628) internal successors, (699), 598 states have internal predecessors, (699), 372 states have call successors, (372), 50 states have call predecessors, (372), 57 states have return successors, (529), 360 states have call predecessors, (529), 371 states have call successors, (529) [2022-07-13 22:42:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1600 transitions. [2022-07-13 22:42:47,501 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1600 transitions. Word has length 126 [2022-07-13 22:42:47,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:47,502 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1600 transitions. [2022-07-13 22:42:47,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 3.8857142857142857) internal successors, (136), 34 states have internal predecessors, (136), 11 states have call successors, (49), 6 states have call predecessors, (49), 8 states have return successors, (45), 9 states have call predecessors, (45), 11 states have call successors, (45) [2022-07-13 22:42:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1600 transitions. [2022-07-13 22:42:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-13 22:42:47,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:47,504 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:42:47,526 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-13 22:42:47,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:47,719 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:47,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:47,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1292205762, now seen corresponding path program 1 times [2022-07-13 22:42:47,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:47,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864205815] [2022-07-13 22:42:47,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:47,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:42:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:42:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:42:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:42:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:42:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:42:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:42:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:42:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:42:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-07-13 22:42:47,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:47,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864205815] [2022-07-13 22:42:47,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864205815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:47,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:47,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:42:47,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906614838] [2022-07-13 22:42:47,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:47,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:42:47,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:47,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:42:47,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:42:47,887 INFO L87 Difference]: Start difference. First operand 1009 states and 1600 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-13 22:42:48,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:48,264 INFO L93 Difference]: Finished difference Result 1585 states and 2521 transitions. [2022-07-13 22:42:48,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:42:48,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2022-07-13 22:42:48,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:48,269 INFO L225 Difference]: With dead ends: 1585 [2022-07-13 22:42:48,269 INFO L226 Difference]: Without dead ends: 1043 [2022-07-13 22:42:48,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:42:48,274 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 63 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:48,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 281 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:42:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2022-07-13 22:42:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1033. [2022-07-13 22:42:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 598 states have (on average 1.2006688963210703) internal successors, (718), 615 states have internal predecessors, (718), 372 states have call successors, (372), 50 states have call predecessors, (372), 62 states have return successors, (545), 367 states have call predecessors, (545), 371 states have call successors, (545) [2022-07-13 22:42:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1635 transitions. [2022-07-13 22:42:48,391 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1635 transitions. Word has length 128 [2022-07-13 22:42:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:48,391 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1635 transitions. [2022-07-13 22:42:48,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-13 22:42:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1635 transitions. [2022-07-13 22:42:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-13 22:42:48,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:48,394 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-07-13 22:42:48,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 22:42:48,394 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:48,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:48,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1683699165, now seen corresponding path program 1 times [2022-07-13 22:42:48,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:48,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42034333] [2022-07-13 22:42:48,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:48,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:42:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:42:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:42:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:42:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 22:42:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:42:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:42:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:42:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:42:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:42:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 22:42:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:42:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 22:42:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-07-13 22:42:48,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:48,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42034333] [2022-07-13 22:42:48,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42034333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:48,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:48,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-13 22:42:48,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054189331] [2022-07-13 22:42:48,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:48,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 22:42:48,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:48,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 22:42:48,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:42:48,685 INFO L87 Difference]: Start difference. First operand 1033 states and 1635 transitions. Second operand has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-13 22:42:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:49,454 INFO L93 Difference]: Finished difference Result 1039 states and 1640 transitions. [2022-07-13 22:42:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 22:42:49,454 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2022-07-13 22:42:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:49,459 INFO L225 Difference]: With dead ends: 1039 [2022-07-13 22:42:49,459 INFO L226 Difference]: Without dead ends: 1037 [2022-07-13 22:42:49,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2022-07-13 22:42:49,461 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 94 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:49,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 731 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:42:49,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2022-07-13 22:42:49,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2022-07-13 22:42:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 601 states have (on average 1.199667221297837) internal successors, (721), 618 states have internal predecessors, (721), 372 states have call successors, (372), 51 states have call predecessors, (372), 63 states have return successors, (545), 367 states have call predecessors, (545), 371 states have call successors, (545) [2022-07-13 22:42:49,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1638 transitions. [2022-07-13 22:42:49,544 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1638 transitions. Word has length 159 [2022-07-13 22:42:49,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:49,544 INFO L495 AbstractCegarLoop]: Abstraction has 1037 states and 1638 transitions. [2022-07-13 22:42:49,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-13 22:42:49,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1638 transitions. [2022-07-13 22:42:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-13 22:42:49,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:49,547 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:42:49,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 22:42:49,547 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:49,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:49,547 INFO L85 PathProgramCache]: Analyzing trace with hash -236851265, now seen corresponding path program 1 times [2022-07-13 22:42:49,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:49,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386958696] [2022-07-13 22:42:49,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:49,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:42:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:42:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:42:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:42:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:42:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:42:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:42:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:42:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:42:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-07-13 22:42:49,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:49,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386958696] [2022-07-13 22:42:49,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386958696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:49,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:49,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:42:49,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939057605] [2022-07-13 22:42:49,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:49,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:42:49,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:49,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:42:49,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:42:49,702 INFO L87 Difference]: Start difference. First operand 1037 states and 1638 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-13 22:42:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:50,059 INFO L93 Difference]: Finished difference Result 1617 states and 2562 transitions. [2022-07-13 22:42:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:42:50,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 129 [2022-07-13 22:42:50,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:50,064 INFO L225 Difference]: With dead ends: 1617 [2022-07-13 22:42:50,064 INFO L226 Difference]: Without dead ends: 1071 [2022-07-13 22:42:50,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:42:50,087 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 62 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:50,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 292 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:42:50,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2022-07-13 22:42:50,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1037. [2022-07-13 22:42:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 601 states have (on average 1.199667221297837) internal successors, (721), 618 states have internal predecessors, (721), 372 states have call successors, (372), 51 states have call predecessors, (372), 63 states have return successors, (545), 367 states have call predecessors, (545), 371 states have call successors, (545) [2022-07-13 22:42:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1638 transitions. [2022-07-13 22:42:50,185 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1638 transitions. Word has length 129 [2022-07-13 22:42:50,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:50,186 INFO L495 AbstractCegarLoop]: Abstraction has 1037 states and 1638 transitions. [2022-07-13 22:42:50,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-13 22:42:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1638 transitions. [2022-07-13 22:42:50,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-13 22:42:50,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:50,188 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:42:50,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 22:42:50,188 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:50,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:50,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2044305728, now seen corresponding path program 1 times [2022-07-13 22:42:50,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:50,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427600433] [2022-07-13 22:42:50,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:50,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:42:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:42:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:42:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:42:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:42:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:42:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:42:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:42:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:42:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:42:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:42:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:42:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-13 22:42:50,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:50,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427600433] [2022-07-13 22:42:50,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427600433] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:50,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546756448] [2022-07-13 22:42:50,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:50,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:50,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:50,741 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-13 22:42:50,754 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-13 22:42:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 2727 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-13 22:42:51,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:51,215 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-13 22:42:51,611 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-13 22:42:51,611 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-13 22:42:52,282 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-13 22:42:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 26 proven. 37 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-13 22:42:52,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:53,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset| Int) (v_ArrVal_1769 Int)) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base|) |ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset| .cse1) (+ |ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset| 8) v_ArrVal_1769)) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|))) (<= (+ (* 18446744073709551616 (div (+ .cse0 18446744073709551615 (* (- 1) .cse1)) 18446744073709551616)) .cse1) .cse0)))) is different from false [2022-07-13 22:42:53,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546756448] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:53,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:42:53,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 33 [2022-07-13 22:42:53,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985379583] [2022-07-13 22:42:53,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:53,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 22:42:53,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:53,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 22:42:53,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1145, Unknown=1, NotChecked=68, Total=1332 [2022-07-13 22:42:53,895 INFO L87 Difference]: Start difference. First operand 1037 states and 1638 transitions. Second operand has 33 states, 25 states have (on average 3.96) internal successors, (99), 29 states have internal predecessors, (99), 15 states have call successors, (39), 7 states have call predecessors, (39), 8 states have return successors, (37), 9 states have call predecessors, (37), 13 states have call successors, (37) [2022-07-13 22:43:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:00,852 INFO L93 Difference]: Finished difference Result 1493 states and 2376 transitions. [2022-07-13 22:43:00,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-13 22:43:00,853 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 25 states have (on average 3.96) internal successors, (99), 29 states have internal predecessors, (99), 15 states have call successors, (39), 7 states have call predecessors, (39), 8 states have return successors, (37), 9 states have call predecessors, (37), 13 states have call successors, (37) Word has length 129 [2022-07-13 22:43:00,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:00,859 INFO L225 Difference]: With dead ends: 1493 [2022-07-13 22:43:00,859 INFO L226 Difference]: Without dead ends: 1415 [2022-07-13 22:43:00,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 246 SyntacticMatches, 8 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=423, Invalid=4687, Unknown=6, NotChecked=140, Total=5256 [2022-07-13 22:43:00,862 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 587 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 3832 mSolverCounterSat, 626 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 5415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 626 IncrementalHoareTripleChecker+Valid, 3832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 957 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:00,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1099 Invalid, 5415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [626 Valid, 3832 Invalid, 0 Unknown, 957 Unchecked, 2.2s Time] [2022-07-13 22:43:00,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2022-07-13 22:43:00,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1292. [2022-07-13 22:43:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 744 states have (on average 1.1975806451612903) internal successors, (891), 760 states have internal predecessors, (891), 465 states have call successors, (465), 58 states have call predecessors, (465), 82 states have return successors, (694), 473 states have call predecessors, (694), 462 states have call successors, (694) [2022-07-13 22:43:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 2050 transitions. [2022-07-13 22:43:00,984 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 2050 transitions. Word has length 129 [2022-07-13 22:43:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:00,984 INFO L495 AbstractCegarLoop]: Abstraction has 1292 states and 2050 transitions. [2022-07-13 22:43:00,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 25 states have (on average 3.96) internal successors, (99), 29 states have internal predecessors, (99), 15 states have call successors, (39), 7 states have call predecessors, (39), 8 states have return successors, (37), 9 states have call predecessors, (37), 13 states have call successors, (37) [2022-07-13 22:43:00,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2050 transitions. [2022-07-13 22:43:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-13 22:43:00,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:00,987 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 3, 3, 3, 3, 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] [2022-07-13 22:43:01,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-13 22:43:01,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:01,207 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:01,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash -456579408, now seen corresponding path program 1 times [2022-07-13 22:43:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:01,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224877973] [2022-07-13 22:43:01,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:01,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:43:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:43:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:43:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:43:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:43:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:43:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:43:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:43:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:43:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:43:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:43:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:43:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:43:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:43:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:43:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 22:43:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:43:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 22:43:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 22:43:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-13 22:43:01,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:01,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224877973] [2022-07-13 22:43:01,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224877973] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:01,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096935485] [2022-07-13 22:43:01,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:01,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:01,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:01,527 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-13 22:43:01,545 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-13 22:43:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:01,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 2821 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:43:01,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-13 22:43:01,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:01,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096935485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:01,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:01,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-13 22:43:01,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523563343] [2022-07-13 22:43:01,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:01,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:43:01,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:01,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:43:01,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:43:01,995 INFO L87 Difference]: Start difference. First operand 1292 states and 2050 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 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-13 22:43:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:02,198 INFO L93 Difference]: Finished difference Result 1955 states and 3124 transitions. [2022-07-13 22:43:02,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:43:02,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 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 163 [2022-07-13 22:43:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:02,210 INFO L225 Difference]: With dead ends: 1955 [2022-07-13 22:43:02,210 INFO L226 Difference]: Without dead ends: 1262 [2022-07-13 22:43:02,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:43:02,215 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 11 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:02,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1270 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:43:02,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2022-07-13 22:43:02,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1262. [2022-07-13 22:43:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 726 states have (on average 1.199724517906336) internal successors, (871), 744 states have internal predecessors, (871), 453 states have call successors, (453), 58 states have call predecessors, (453), 82 states have return successors, (663), 459 states have call predecessors, (663), 450 states have call successors, (663) [2022-07-13 22:43:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1987 transitions. [2022-07-13 22:43:02,364 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1987 transitions. Word has length 163 [2022-07-13 22:43:02,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:02,365 INFO L495 AbstractCegarLoop]: Abstraction has 1262 states and 1987 transitions. [2022-07-13 22:43:02,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 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-13 22:43:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1987 transitions. [2022-07-13 22:43:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-13 22:43:02,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:02,367 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:43:02,409 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-13 22:43:02,586 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,SelfDestructingSolverStorable23 [2022-07-13 22:43:02,587 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:02,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:02,587 INFO L85 PathProgramCache]: Analyzing trace with hash -834241185, now seen corresponding path program 1 times [2022-07-13 22:43:02,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:02,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752897559] [2022-07-13 22:43:02,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:02,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:43:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:43:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:43:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:43:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:43:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:43:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:43:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:43:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:43:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:43:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:43:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:43:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 22:43:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:43:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-13 22:43:02,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:02,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752897559] [2022-07-13 22:43:02,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752897559] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:02,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513239129] [2022-07-13 22:43:02,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:02,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:02,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:02,881 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-13 22:43:02,905 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-13 22:43:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:03,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 2748 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:43:03,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-13 22:43:03,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:03,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513239129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:03,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:03,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-13 22:43:03,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114621368] [2022-07-13 22:43:03,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:03,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:43:03,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:03,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:43:03,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:43:03,370 INFO L87 Difference]: Start difference. First operand 1262 states and 1987 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-13 22:43:03,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:03,545 INFO L93 Difference]: Finished difference Result 1811 states and 2893 transitions. [2022-07-13 22:43:03,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:43:03,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 131 [2022-07-13 22:43:03,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:03,550 INFO L225 Difference]: With dead ends: 1811 [2022-07-13 22:43:03,550 INFO L226 Difference]: Without dead ends: 974 [2022-07-13 22:43:03,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:43:03,556 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 11 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:03,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1260 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:43:03,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2022-07-13 22:43:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 962. [2022-07-13 22:43:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 565 states have (on average 1.1557522123893806) internal successors, (653), 568 states have internal predecessors, (653), 328 states have call successors, (328), 54 states have call predecessors, (328), 68 states have return successors, (457), 339 states have call predecessors, (457), 325 states have call successors, (457) [2022-07-13 22:43:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1438 transitions. [2022-07-13 22:43:03,669 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1438 transitions. Word has length 131 [2022-07-13 22:43:03,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:03,670 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 1438 transitions. [2022-07-13 22:43:03,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-13 22:43:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1438 transitions. [2022-07-13 22:43:03,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-13 22:43:03,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:03,672 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:43:03,694 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-13 22:43:03,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:03,887 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:03,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1554147384, now seen corresponding path program 2 times [2022-07-13 22:43:03,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:03,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214293440] [2022-07-13 22:43:03,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:03,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:43:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:43:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:43:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:43:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:43:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:43:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:43:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:43:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:43:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:43:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:43:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 22:43:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:43:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 22:43:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-13 22:43:04,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:04,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214293440] [2022-07-13 22:43:04,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214293440] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:04,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482437947] [2022-07-13 22:43:04,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:43:04,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:04,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:04,374 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-13 22:43:04,375 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-13 22:43:05,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:43:05,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:43:05,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 2758 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-13 22:43:05,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:05,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:43:05,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:43:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 87 proven. 13 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 22:43:06,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:43:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 42 proven. 16 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 22:43:06,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482437947] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:43:06,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:43:06,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 11] total 42 [2022-07-13 22:43:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815989211] [2022-07-13 22:43:06,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:43:06,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-13 22:43:06,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:06,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-13 22:43:06,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1579, Unknown=0, NotChecked=0, Total=1722 [2022-07-13 22:43:06,669 INFO L87 Difference]: Start difference. First operand 962 states and 1438 transitions. Second operand has 42 states, 39 states have (on average 3.8461538461538463) internal successors, (150), 38 states have internal predecessors, (150), 12 states have call successors, (53), 8 states have call predecessors, (53), 9 states have return successors, (49), 9 states have call predecessors, (49), 11 states have call successors, (49) [2022-07-13 22:43:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:12,645 INFO L93 Difference]: Finished difference Result 1602 states and 2423 transitions. [2022-07-13 22:43:12,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-13 22:43:12,646 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 3.8461538461538463) internal successors, (150), 38 states have internal predecessors, (150), 12 states have call successors, (53), 8 states have call predecessors, (53), 9 states have return successors, (49), 9 states have call predecessors, (49), 11 states have call successors, (49) Word has length 133 [2022-07-13 22:43:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:12,650 INFO L225 Difference]: With dead ends: 1602 [2022-07-13 22:43:12,650 INFO L226 Difference]: Without dead ends: 1122 [2022-07-13 22:43:12,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 283 SyntacticMatches, 9 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2632 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1043, Invalid=8659, Unknown=0, NotChecked=0, Total=9702 [2022-07-13 22:43:12,655 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 684 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 6253 mSolverCounterSat, 1055 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 8090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1055 IncrementalHoareTripleChecker+Valid, 6253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 782 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:12,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1123 Invalid, 8090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1055 Valid, 6253 Invalid, 0 Unknown, 782 Unchecked, 3.7s Time] [2022-07-13 22:43:12,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-07-13 22:43:12,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1000. [2022-07-13 22:43:12,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 595 states have (on average 1.1663865546218488) internal successors, (694), 606 states have internal predecessors, (694), 324 states have call successors, (324), 62 states have call predecessors, (324), 80 states have return successors, (439), 331 states have call predecessors, (439), 321 states have call successors, (439) [2022-07-13 22:43:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1457 transitions. [2022-07-13 22:43:12,761 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1457 transitions. Word has length 133 [2022-07-13 22:43:12,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:12,761 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1457 transitions. [2022-07-13 22:43:12,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 3.8461538461538463) internal successors, (150), 38 states have internal predecessors, (150), 12 states have call successors, (53), 8 states have call predecessors, (53), 9 states have return successors, (49), 9 states have call predecessors, (49), 11 states have call successors, (49) [2022-07-13 22:43:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1457 transitions. [2022-07-13 22:43:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-13 22:43:12,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:12,764 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 22:43:12,785 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-13 22:43:12,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:12,985 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:12,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:12,985 INFO L85 PathProgramCache]: Analyzing trace with hash -834626846, now seen corresponding path program 1 times [2022-07-13 22:43:12,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:12,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368093993] [2022-07-13 22:43:12,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:12,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:43:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:43:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:43:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:43:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:43:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:43:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:43:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:43:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 22:43:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:43:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:43:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:43:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:43:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:43:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:43:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:43:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-13 22:43:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 22:43:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 22:43:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-13 22:43:13,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:13,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368093993] [2022-07-13 22:43:13,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368093993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:13,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:13,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:43:13,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720103610] [2022-07-13 22:43:13,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:13,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:43:13,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:13,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:43:13,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:43:13,208 INFO L87 Difference]: Start difference. First operand 1000 states and 1457 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 1 states have call successors, (22) [2022-07-13 22:43:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:13,670 INFO L93 Difference]: Finished difference Result 1006 states and 1462 transitions. [2022-07-13 22:43:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:43:13,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 1 states have call successors, (22) Word has length 169 [2022-07-13 22:43:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:13,675 INFO L225 Difference]: With dead ends: 1006 [2022-07-13 22:43:13,675 INFO L226 Difference]: Without dead ends: 1004 [2022-07-13 22:43:13,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:43:13,676 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 139 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:13,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 501 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:43:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2022-07-13 22:43:13,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2022-07-13 22:43:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 598 states have (on average 1.165551839464883) internal successors, (697), 609 states have internal predecessors, (697), 324 states have call successors, (324), 63 states have call predecessors, (324), 81 states have return successors, (439), 331 states have call predecessors, (439), 321 states have call successors, (439) [2022-07-13 22:43:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1460 transitions. [2022-07-13 22:43:13,784 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1460 transitions. Word has length 169 [2022-07-13 22:43:13,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:13,785 INFO L495 AbstractCegarLoop]: Abstraction has 1004 states and 1460 transitions. [2022-07-13 22:43:13,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 1 states have call successors, (22) [2022-07-13 22:43:13,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1460 transitions. [2022-07-13 22:43:13,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-13 22:43:13,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:13,787 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:43:13,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 22:43:13,787 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:13,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:13,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1229517098, now seen corresponding path program 1 times [2022-07-13 22:43:13,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:13,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540069435] [2022-07-13 22:43:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:13,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:43:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:43:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:43:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:43:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:43:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:43:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:43:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:43:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 22:43:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:43:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:43:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:43:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:43:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:43:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:43:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:43:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-13 22:43:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 22:43:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 22:43:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 19 proven. 57 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-07-13 22:43:14,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:14,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540069435] [2022-07-13 22:43:14,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540069435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:14,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5551342] [2022-07-13 22:43:14,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:14,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:14,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:14,210 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-13 22:43:14,216 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-13 22:43:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:14,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 2872 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-13 22:43:14,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:17,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-13 22:43:17,420 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 25 treesize of output 17 [2022-07-13 22:43:17,423 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 21 treesize of output 13 [2022-07-13 22:43:17,534 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 138 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-13 22:43:17,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:43:18,236 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 9 treesize of output 3 [2022-07-13 22:43:18,238 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-13 22:43:18,239 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 23 treesize of output 15 [2022-07-13 22:43:18,458 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:43:18,458 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 51 treesize of output 54 [2022-07-13 22:43:18,467 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:43:18,467 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 39 treesize of output 42 [2022-07-13 22:43:18,565 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:43:18,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-07-13 22:43:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2022-07-13 22:43:18,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5551342] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:43:18,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:43:18,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 14] total 44 [2022-07-13 22:43:18,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844490642] [2022-07-13 22:43:18,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:43:18,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-13 22:43:18,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:18,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-13 22:43:18,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1693, Unknown=1, NotChecked=0, Total=1892 [2022-07-13 22:43:18,622 INFO L87 Difference]: Start difference. First operand 1004 states and 1460 transitions. Second operand has 44 states, 41 states have (on average 4.048780487804878) internal successors, (166), 41 states have internal predecessors, (166), 14 states have call successors, (62), 9 states have call predecessors, (62), 13 states have return successors, (59), 11 states have call predecessors, (59), 14 states have call successors, (59) [2022-07-13 22:43:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:25,857 INFO L93 Difference]: Finished difference Result 1713 states and 2463 transitions. [2022-07-13 22:43:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-13 22:43:25,858 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 4.048780487804878) internal successors, (166), 41 states have internal predecessors, (166), 14 states have call successors, (62), 9 states have call predecessors, (62), 13 states have return successors, (59), 11 states have call predecessors, (59), 14 states have call successors, (59) Word has length 173 [2022-07-13 22:43:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:25,862 INFO L225 Difference]: With dead ends: 1713 [2022-07-13 22:43:25,862 INFO L226 Difference]: Without dead ends: 1104 [2022-07-13 22:43:25,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 371 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=944, Invalid=5860, Unknown=2, NotChecked=0, Total=6806 [2022-07-13 22:43:25,867 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 624 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 5915 mSolverCounterSat, 752 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 7266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 752 IncrementalHoareTripleChecker+Valid, 5915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 599 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:25,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 836 Invalid, 7266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [752 Valid, 5915 Invalid, 0 Unknown, 599 Unchecked, 3.6s Time] [2022-07-13 22:43:25,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2022-07-13 22:43:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 951. [2022-07-13 22:43:25,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 562 states have (on average 1.1654804270462633) internal successors, (655), 576 states have internal predecessors, (655), 309 states have call successors, (309), 63 states have call predecessors, (309), 79 states have return successors, (399), 311 states have call predecessors, (399), 307 states have call successors, (399) [2022-07-13 22:43:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1363 transitions. [2022-07-13 22:43:25,978 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1363 transitions. Word has length 173 [2022-07-13 22:43:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:25,978 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1363 transitions. [2022-07-13 22:43:25,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 4.048780487804878) internal successors, (166), 41 states have internal predecessors, (166), 14 states have call successors, (62), 9 states have call predecessors, (62), 13 states have return successors, (59), 11 states have call predecessors, (59), 14 states have call successors, (59) [2022-07-13 22:43:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1363 transitions. [2022-07-13 22:43:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 22:43:25,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:25,981 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:43:26,001 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-13 22:43:26,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:26,211 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:26,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:26,211 INFO L85 PathProgramCache]: Analyzing trace with hash -459423214, now seen corresponding path program 1 times [2022-07-13 22:43:26,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:26,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858478860] [2022-07-13 22:43:26,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:26,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:43:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:43:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:43:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:43:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:43:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:43:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:43:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:43:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:43:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:43:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:43:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 22:43:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 22:43:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 22:43:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 26 proven. 33 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-13 22:43:26,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:26,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858478860] [2022-07-13 22:43:26,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858478860] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:26,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752439908] [2022-07-13 22:43:26,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:26,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:26,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:26,538 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-13 22:43:26,539 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-13 22:43:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:26,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 2789 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-13 22:43:26,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:27,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:43:27,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:43:27,317 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 22:43:27,317 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-13 22:43:27,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:43:27,414 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 22:43:27,414 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 28 treesize of output 12 [2022-07-13 22:43:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 97 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 22:43:28,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:43:36,773 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 9 treesize of output 5 [2022-07-13 22:43:36,902 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:43:36,903 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-13 22:43:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 22:43:36,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752439908] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:43:36,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:43:36,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22, 20] total 51 [2022-07-13 22:43:36,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68707518] [2022-07-13 22:43:36,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:43:36,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-13 22:43:36,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:36,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-13 22:43:36,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2359, Unknown=2, NotChecked=0, Total=2550 [2022-07-13 22:43:36,964 INFO L87 Difference]: Start difference. First operand 951 states and 1363 transitions. Second operand has 51 states, 48 states have (on average 4.083333333333333) internal successors, (196), 45 states have internal predecessors, (196), 17 states have call successors, (52), 13 states have call predecessors, (52), 15 states have return successors, (48), 14 states have call predecessors, (48), 15 states have call successors, (48) [2022-07-13 22:43:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:42,742 INFO L93 Difference]: Finished difference Result 1587 states and 2275 transitions. [2022-07-13 22:43:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-07-13 22:43:42,745 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 4.083333333333333) internal successors, (196), 45 states have internal predecessors, (196), 17 states have call successors, (52), 13 states have call predecessors, (52), 15 states have return successors, (48), 14 states have call predecessors, (48), 15 states have call successors, (48) Word has length 139 [2022-07-13 22:43:42,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:42,749 INFO L225 Difference]: With dead ends: 1587 [2022-07-13 22:43:42,749 INFO L226 Difference]: Without dead ends: 1084 [2022-07-13 22:43:42,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 281 SyntacticMatches, 7 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2847 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=1113, Invalid=9804, Unknown=3, NotChecked=0, Total=10920 [2022-07-13 22:43:42,753 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 503 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 6905 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 9160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 6905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1863 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:42,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1510 Invalid, 9160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 6905 Invalid, 0 Unknown, 1863 Unchecked, 3.4s Time] [2022-07-13 22:43:42,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2022-07-13 22:43:42,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1030. [2022-07-13 22:43:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 629 states have (on average 1.1446740858505564) internal successors, (720), 636 states have internal predecessors, (720), 306 states have call successors, (306), 78 states have call predecessors, (306), 94 states have return successors, (381), 315 states have call predecessors, (381), 304 states have call successors, (381) [2022-07-13 22:43:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1407 transitions. [2022-07-13 22:43:42,897 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1407 transitions. Word has length 139 [2022-07-13 22:43:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:42,897 INFO L495 AbstractCegarLoop]: Abstraction has 1030 states and 1407 transitions. [2022-07-13 22:43:42,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 4.083333333333333) internal successors, (196), 45 states have internal predecessors, (196), 17 states have call successors, (52), 13 states have call predecessors, (52), 15 states have return successors, (48), 14 states have call predecessors, (48), 15 states have call successors, (48) [2022-07-13 22:43:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1407 transitions. [2022-07-13 22:43:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-13 22:43:42,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:42,904 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 22:43:42,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-13 22:43:43,119 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,SelfDestructingSolverStorable28 [2022-07-13 22:43:43,119 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:43,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:43,119 INFO L85 PathProgramCache]: Analyzing trace with hash -781558313, now seen corresponding path program 1 times [2022-07-13 22:43:43,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:43,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452599294] [2022-07-13 22:43:43,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:43,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:43:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:43:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:43:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:43:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:43:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:43:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:43:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:43:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:43:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:43:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:43:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 22:43:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 22:43:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:43:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2022-07-13 22:43:43,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:43,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452599294] [2022-07-13 22:43:43,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452599294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:43,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:43,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-13 22:43:43,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143627163] [2022-07-13 22:43:43,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:43,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 22:43:43,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:43,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 22:43:43,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:43:43,388 INFO L87 Difference]: Start difference. First operand 1030 states and 1407 transitions. Second operand has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 22:43:44,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:44,207 INFO L93 Difference]: Finished difference Result 1052 states and 1432 transitions. [2022-07-13 22:43:44,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 22:43:44,207 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2022-07-13 22:43:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:44,210 INFO L225 Difference]: With dead ends: 1052 [2022-07-13 22:43:44,210 INFO L226 Difference]: Without dead ends: 1050 [2022-07-13 22:43:44,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2022-07-13 22:43:44,212 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 155 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:44,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 714 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:43:44,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2022-07-13 22:43:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1042. [2022-07-13 22:43:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 635 states have (on average 1.1433070866141732) internal successors, (726), 642 states have internal predecessors, (726), 310 states have call successors, (310), 80 states have call predecessors, (310), 96 states have return successors, (385), 319 states have call predecessors, (385), 308 states have call successors, (385) [2022-07-13 22:43:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1421 transitions. [2022-07-13 22:43:44,421 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1421 transitions. Word has length 149 [2022-07-13 22:43:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:44,421 INFO L495 AbstractCegarLoop]: Abstraction has 1042 states and 1421 transitions. [2022-07-13 22:43:44,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 22:43:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1421 transitions. [2022-07-13 22:43:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-13 22:43:44,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:44,424 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 22:43:44,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-13 22:43:44,424 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:44,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:44,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1640017927, now seen corresponding path program 1 times [2022-07-13 22:43:44,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:44,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61778324] [2022-07-13 22:43:44,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:44,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:43:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:43:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:43:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:43:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:44,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:43:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:43:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:43:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:43:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:43:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:43:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:43:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 22:43:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-13 22:43:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-13 22:43:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-07-13 22:43:45,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:45,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61778324] [2022-07-13 22:43:45,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61778324] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:45,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386762392] [2022-07-13 22:43:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:45,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:45,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:45,086 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-13 22:43:45,088 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-13 22:43:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:45,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 2901 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-13 22:43:45,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:45,602 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-13 22:43:45,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:43:45,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:43:45,892 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 16 treesize of output 18 [2022-07-13 22:43:45,894 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 16 treesize of output 18 [2022-07-13 22:43:45,904 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-13 22:43:45,905 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-13 22:43:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 22:43:45,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:43:46,026 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2506 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base| v_ArrVal_2506) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|)) 0)) (forall ((v_ArrVal_2505 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base| v_ArrVal_2505) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|)) 0))) is different from false [2022-07-13 22:43:46,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386762392] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:46,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:43:46,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2022-07-13 22:43:46,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453391124] [2022-07-13 22:43:46,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:43:46,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 22:43:46,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:46,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 22:43:46,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=532, Unknown=1, NotChecked=46, Total=650 [2022-07-13 22:43:46,035 INFO L87 Difference]: Start difference. First operand 1042 states and 1421 transitions. Second operand has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 21 states have internal predecessors, (115), 10 states have call successors, (39), 5 states have call predecessors, (39), 7 states have return successors, (37), 9 states have call predecessors, (37), 10 states have call successors, (37) [2022-07-13 22:43:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:47,529 INFO L93 Difference]: Finished difference Result 1882 states and 2543 transitions. [2022-07-13 22:43:47,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 22:43:47,529 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 21 states have internal predecessors, (115), 10 states have call successors, (39), 5 states have call predecessors, (39), 7 states have return successors, (37), 9 states have call predecessors, (37), 10 states have call successors, (37) Word has length 159 [2022-07-13 22:43:47,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:47,533 INFO L225 Difference]: With dead ends: 1882 [2022-07-13 22:43:47,533 INFO L226 Difference]: Without dead ends: 1065 [2022-07-13 22:43:47,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 296 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=1699, Unknown=1, NotChecked=84, Total=1980 [2022-07-13 22:43:47,537 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 211 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 2435 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 2924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 2435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 352 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:47,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 693 Invalid, 2924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 2435 Invalid, 0 Unknown, 352 Unchecked, 1.1s Time] [2022-07-13 22:43:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2022-07-13 22:43:47,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1044. [2022-07-13 22:43:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 639 states have (on average 1.1408450704225352) internal successors, (729), 646 states have internal predecessors, (729), 306 states have call successors, (306), 82 states have call predecessors, (306), 98 states have return successors, (379), 315 states have call predecessors, (379), 304 states have call successors, (379) [2022-07-13 22:43:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1414 transitions. [2022-07-13 22:43:47,686 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1414 transitions. Word has length 159 [2022-07-13 22:43:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:47,686 INFO L495 AbstractCegarLoop]: Abstraction has 1044 states and 1414 transitions. [2022-07-13 22:43:47,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 21 states have internal predecessors, (115), 10 states have call successors, (39), 5 states have call predecessors, (39), 7 states have return successors, (37), 9 states have call predecessors, (37), 10 states have call successors, (37) [2022-07-13 22:43:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1414 transitions. [2022-07-13 22:43:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-13 22:43:47,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:47,698 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:43:47,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-13 22:43:47,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:47,912 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:47,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash -585263233, now seen corresponding path program 1 times [2022-07-13 22:43:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:47,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933513986] [2022-07-13 22:43:47,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:47,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:43:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:43:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:43:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:43:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:43:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:43:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:43:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:43:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:43:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:43:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 22:43:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:43:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:43:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 22:43:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 22:43:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-13 22:43:48,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:48,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933513986] [2022-07-13 22:43:48,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933513986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:48,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010452009] [2022-07-13 22:43:48,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:48,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:48,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:48,773 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:43:48,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-13 22:43:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 2893 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-13 22:43:49,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:49,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:43:50,074 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-13 22:43:50,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:43:50,086 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 22:43:50,086 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-13 22:43:50,101 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-13 22:43:54,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:43:54,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:43:54,392 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-13 22:43:54,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:43:54,401 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((|save_byte_from_array_~storage#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2654 (Array Int Int))) (and (= |c_#memory_int| (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| v_ArrVal_2654)) (= (store |c_old(#memory_$Pointer$.base)| |save_byte_from_array_~storage#1.base| v_arrayElimArr_1) |c_#memory_$Pointer$.base|)))) is different from true [2022-07-13 22:43:54,425 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:43:54,425 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-13 22:43:54,449 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-13 22:43:54,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 28 treesize of output 47 [2022-07-13 22:43:54,500 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 4 [2022-07-13 22:43:54,507 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 4 [2022-07-13 22:43:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 135 proven. 48 refuted. 0 times theorem prover too weak. 30 trivial. 2 not checked. [2022-07-13 22:43:56,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:43:59,713 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-13 22:43:59,717 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-13 22:43:59,722 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2669 (Array Int Int)) (|v_save_byte_from_array_~storage#1.base_102| Int)) (= (mod (select (select (store |c_#memory_int| |v_save_byte_from_array_~storage#1.base_102| v_ArrVal_2669) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset|) 18446744073709551616) 0)) (<= 0 |c_#StackHeapBarrier|)) is different from false [2022-07-13 22:43:59,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010452009] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:59,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:43:59,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 35] total 57 [2022-07-13 22:43:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694406830] [2022-07-13 22:43:59,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:43:59,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-13 22:43:59,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:59,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-13 22:43:59,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=4428, Unknown=5, NotChecked=270, Total=4970 [2022-07-13 22:43:59,724 INFO L87 Difference]: Start difference. First operand 1044 states and 1414 transitions. Second operand has 57 states, 52 states have (on average 2.9615384615384617) internal successors, (154), 45 states have internal predecessors, (154), 18 states have call successors, (43), 13 states have call predecessors, (43), 15 states have return successors, (40), 18 states have call predecessors, (40), 16 states have call successors, (40) [2022-07-13 22:44:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:44,495 INFO L93 Difference]: Finished difference Result 2341 states and 3163 transitions. [2022-07-13 22:44:44,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-07-13 22:44:44,496 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 52 states have (on average 2.9615384615384617) internal successors, (154), 45 states have internal predecessors, (154), 18 states have call successors, (43), 13 states have call predecessors, (43), 15 states have return successors, (40), 18 states have call predecessors, (40), 16 states have call successors, (40) Word has length 163 [2022-07-13 22:44:44,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:44,502 INFO L225 Difference]: With dead ends: 2341 [2022-07-13 22:44:44,502 INFO L226 Difference]: Without dead ends: 1854 [2022-07-13 22:44:44,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 253 SyntacticMatches, 7 SemanticMatches, 130 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4288 ImplicationChecksByTransitivity, 48.4s TimeCoverageRelationStatistics Valid=1174, Invalid=15570, Unknown=34, NotChecked=514, Total=17292 [2022-07-13 22:44:44,505 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 593 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 9420 mSolverCounterSat, 777 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 2293 SdHoareTripleChecker+Invalid, 14520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 777 IncrementalHoareTripleChecker+Valid, 9420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4323 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:44,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 2293 Invalid, 14520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [777 Valid, 9420 Invalid, 0 Unknown, 4323 Unchecked, 5.1s Time] [2022-07-13 22:44:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2022-07-13 22:44:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1715. [2022-07-13 22:44:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1059 states have (on average 1.1350330500472143) internal successors, (1202), 1073 states have internal predecessors, (1202), 485 states have call successors, (485), 143 states have call predecessors, (485), 170 states have return successors, (602), 498 states have call predecessors, (602), 481 states have call successors, (602) [2022-07-13 22:44:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2289 transitions. [2022-07-13 22:44:44,677 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2289 transitions. Word has length 163 [2022-07-13 22:44:44,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:44,677 INFO L495 AbstractCegarLoop]: Abstraction has 1715 states and 2289 transitions. [2022-07-13 22:44:44,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 52 states have (on average 2.9615384615384617) internal successors, (154), 45 states have internal predecessors, (154), 18 states have call successors, (43), 13 states have call predecessors, (43), 15 states have return successors, (40), 18 states have call predecessors, (40), 16 states have call successors, (40) [2022-07-13 22:44:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2289 transitions. [2022-07-13 22:44:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-13 22:44:44,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:44,680 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:44:44,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-13 22:44:44,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:44:44,895 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:44,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:44,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1223864561, now seen corresponding path program 1 times [2022-07-13 22:44:44,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:44,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167649545] [2022-07-13 22:44:44,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:44,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:44:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:44:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:44:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:44:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:44:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:44:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:44:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:44:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:44:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:44:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:44:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:44:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:44:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:44:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:44:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:44:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:44:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:44:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:44:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-13 22:44:45,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:45,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167649545] [2022-07-13 22:44:45,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167649545] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:44:45,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022551316] [2022-07-13 22:44:45,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:45,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:44:45,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:44:45,796 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:44:45,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-13 22:44:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:46,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 2875 conjuncts, 127 conjunts are in the unsatisfiable core [2022-07-13 22:44:46,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:44:46,362 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-13 22:44:46,726 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-13 22:44:46,726 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 23 treesize of output 22 [2022-07-13 22:44:46,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:44:47,689 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 30 treesize of output 18 [2022-07-13 22:44:47,691 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 13 treesize of output 9 [2022-07-13 22:44:47,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:44:47,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-07-13 22:44:47,885 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2820 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_2820))) (exists ((v_ArrVal_2819 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_2819) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 22:44:47,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:44:47,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:44:47,901 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2822 (Array Int Int)) (v_ArrVal_2821 (Array Int Int)) (|save_byte_from_array_~storage#1.base| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| v_ArrVal_2822)) (= (store |c_old(#memory_$Pointer$.base)| |save_byte_from_array_~storage#1.base| v_ArrVal_2821) |c_#memory_$Pointer$.base|)))) is different from true [2022-07-13 22:44:47,948 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-13 22:44:47,949 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 36 treesize of output 45 [2022-07-13 22:44:47,972 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:44:47,973 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 17 treesize of output 23 [2022-07-13 22:44:47,987 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 4 [2022-07-13 22:44:48,002 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 7 treesize of output 5 [2022-07-13 22:44:48,012 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 24 treesize of output 18 [2022-07-13 22:44:48,120 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 55 treesize of output 47 [2022-07-13 22:44:48,223 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 19 treesize of output 11 [2022-07-13 22:44:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 22 proven. 111 refuted. 0 times theorem prover too weak. 52 trivial. 2 not checked. [2022-07-13 22:44:51,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:44:53,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_save_byte_from_array_~storage#1.base_109| Int) (v_ArrVal_2830 (Array Int Int)) (v_ArrVal_2829 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_save_byte_from_array_~storage#1.base_109| v_ArrVal_2829))) (or (let ((.cse0 (mod (select (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|) 18446744073709551616))) (and (<= .cse0 9223372036854775807) (< 0 .cse0))) (and (not (= (select (select (store |c_#memory_$Pointer$.base| |v_save_byte_from_array_~storage#1.base_109| v_ArrVal_2830) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset|)) 0)) (<= 0 |c_#StackHeapBarrier|) (< 0 (mod (select (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset|) 18446744073709551616)))))) is different from false [2022-07-13 22:44:53,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022551316] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:44:53,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:44:53,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 43] total 66 [2022-07-13 22:44:53,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928181137] [2022-07-13 22:44:53,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:44:53,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-13 22:44:53,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:53,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-13 22:44:53,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=5697, Unknown=5, NotChecked=462, Total=6480 [2022-07-13 22:44:53,353 INFO L87 Difference]: Start difference. First operand 1715 states and 2289 transitions. Second operand has 66 states, 58 states have (on average 2.7758620689655173) internal successors, (161), 55 states have internal predecessors, (161), 21 states have call successors, (45), 11 states have call predecessors, (45), 18 states have return successors, (44), 20 states have call predecessors, (44), 21 states have call successors, (44) [2022-07-13 22:45:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:45:54,656 INFO L93 Difference]: Finished difference Result 1887 states and 2461 transitions. [2022-07-13 22:45:54,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-13 22:45:54,657 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 58 states have (on average 2.7758620689655173) internal successors, (161), 55 states have internal predecessors, (161), 21 states have call successors, (45), 11 states have call predecessors, (45), 18 states have return successors, (44), 20 states have call predecessors, (44), 21 states have call successors, (44) Word has length 165 [2022-07-13 22:45:54,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:45:54,662 INFO L225 Difference]: With dead ends: 1887 [2022-07-13 22:45:54,662 INFO L226 Difference]: Without dead ends: 1554 [2022-07-13 22:45:54,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 248 SyntacticMatches, 3 SemanticMatches, 127 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4309 ImplicationChecksByTransitivity, 62.9s TimeCoverageRelationStatistics Valid=1020, Invalid=14700, Unknown=42, NotChecked=750, Total=16512 [2022-07-13 22:45:54,664 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 389 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 6180 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 8620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 6180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2073 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:45:54,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1468 Invalid, 8620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 6180 Invalid, 0 Unknown, 2073 Unchecked, 3.6s Time] [2022-07-13 22:45:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2022-07-13 22:45:54,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2022-07-13 22:45:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 948 states have (on average 1.129746835443038) internal successors, (1071), 957 states have internal predecessors, (1071), 426 states have call successors, (426), 134 states have call predecessors, (426), 153 states have return successors, (522), 436 states have call predecessors, (522), 422 states have call successors, (522) [2022-07-13 22:45:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2019 transitions. [2022-07-13 22:45:54,814 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2019 transitions. Word has length 165 [2022-07-13 22:45:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:45:54,814 INFO L495 AbstractCegarLoop]: Abstraction has 1528 states and 2019 transitions. [2022-07-13 22:45:54,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 58 states have (on average 2.7758620689655173) internal successors, (161), 55 states have internal predecessors, (161), 21 states have call successors, (45), 11 states have call predecessors, (45), 18 states have return successors, (44), 20 states have call predecessors, (44), 21 states have call successors, (44) [2022-07-13 22:45:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2019 transitions. [2022-07-13 22:45:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-13 22:45:54,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:45:54,817 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 22:45:54,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-13 22:45:55,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:45:55,038 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:45:55,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:45:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash 296655668, now seen corresponding path program 1 times [2022-07-13 22:45:55,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:45:55,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848926520] [2022-07-13 22:45:55,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:55,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:45:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:55,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:45:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:55,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:45:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:55,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:45:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:55,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:45:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:55,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:45:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:55,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:45:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:55,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:45:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:55,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:45:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:55,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:45:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:55,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:45:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:56,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:56,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:45:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:56,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:45:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:56,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:45:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:56,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:45:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:56,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:45:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:56,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 22:45:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:56,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:45:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:56,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:45:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:56,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 22:45:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:56,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 22:45:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-07-13 22:45:56,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:45:56,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848926520] [2022-07-13 22:45:56,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848926520] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:45:56,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847327626] [2022-07-13 22:45:56,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:45:56,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:45:56,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:45:56,324 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:45:56,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-13 22:45:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:45:56,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 2938 conjuncts, 125 conjunts are in the unsatisfiable core [2022-07-13 22:45:56,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:45:56,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:45:57,306 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 17 treesize of output 13 [2022-07-13 22:45:57,308 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 21 treesize of output 13 [2022-07-13 22:45:57,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:45:57,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:45:57,576 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-13 22:45:57,580 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_1| Int)) (= (select |c_#valid| |v_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_1|) 1)) (exists ((v_arrayElimArr_2 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_save_byte_from_array_#in~storage#1.base| v_arrayElimArr_2) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 22:45:57,594 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:45:57,594 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 16 treesize of output 22 [2022-07-13 22:45:57,606 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 7 treesize of output 3 [2022-07-13 22:45:57,682 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 22:45:57,683 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-13 22:45:57,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:45:57,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:45:57,981 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-13 22:45:57,986 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-13 22:45:57,989 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimArr_4 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_save_byte_from_array_#in~storage#1.base| v_arrayElimArr_4) |c_#memory_$Pointer$.base|)) (or (not (= |c_save_byte_from_array_#in~array#1.base| 0)) (not (= |c_save_byte_from_array_#in~array#1.offset| 0))) (exists ((v_arrayElimArr_3 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_save_byte_from_array_#in~storage#1.base| v_arrayElimArr_3) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 22:45:58,008 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:45:58,009 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 28 treesize of output 34 [2022-07-13 22:45:58,019 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:45:58,020 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 40 treesize of output 44 [2022-07-13 22:45:58,037 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 4 [2022-07-13 22:45:58,038 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 7 treesize of output 3