./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_read_u8_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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_read_u8_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 f1ac591932d47e9b0b8902b9705db38e4b5e721c8f02110220ca6714b79582bb --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 09:39:38,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:39:38,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:39:38,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:39:38,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:39:38,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:39:38,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:39:38,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:39:38,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:39:38,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:39:38,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:39:38,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:39:38,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:39:38,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:39:38,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:39:38,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:39:38,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:39:38,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:39:38,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:39:38,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:39:38,506 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:39:38,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:39:38,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:39:38,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:39:38,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:39:38,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:39:38,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:39:38,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:39:38,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:39:38,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:39:38,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:39:38,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:39:38,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:39:38,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:39:38,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:39:38,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:39:38,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:39:38,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:39:38,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:39:38,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:39:38,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:39:38,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:39:38,534 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 09:39:38,567 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:39:38,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:39:38,568 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:39:38,568 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:39:38,569 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:39:38,569 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:39:38,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:39:38,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:39:38,570 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:39:38,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:39:38,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 09:39:38,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:39:38,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:39:38,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:39:38,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:39:38,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:39:38,573 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:39:38,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:39:38,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:39:38,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:39:38,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:39:38,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:39:38,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:39:38,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:39:38,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:39:38,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 09:39:38,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 09:39:38,575 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:39:38,575 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:39:38,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:39:38,576 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 -> f1ac591932d47e9b0b8902b9705db38e4b5e721c8f02110220ca6714b79582bb [2022-07-21 09:39:38,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:39:38,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:39:38,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:39:38,892 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:39:38,893 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:39:38,895 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_read_u8_harness.i [2022-07-21 09:39:38,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7e2b2f6/23a315e20a5148e2b17a86c6233a0312/FLAGb506aafe9 [2022-07-21 09:39:39,760 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:39:39,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_read_u8_harness.i [2022-07-21 09:39:39,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7e2b2f6/23a315e20a5148e2b17a86c6233a0312/FLAGb506aafe9 [2022-07-21 09:39:40,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7e2b2f6/23a315e20a5148e2b17a86c6233a0312 [2022-07-21 09:39:40,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:39:40,316 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:39:40,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:39:40,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:39:40,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:39:40,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:39:40" (1/1) ... [2022-07-21 09:39:40,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a393da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:39:40, skipping insertion in model container [2022-07-21 09:39:40,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:39:40" (1/1) ... [2022-07-21 09:39:40,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:39:40,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:39:40,644 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_read_u8_harness.i[4497,4510] [2022-07-21 09:39:40,650 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_read_u8_harness.i[4557,4570] [2022-07-21 09:39:41,248 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,249 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,249 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,250 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,251 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,260 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,260 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,262 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,262 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,510 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-21 09:39:41,511 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-21 09:39:41,512 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-21 09:39:41,515 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-21 09:39:41,516 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-21 09:39:41,518 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-21 09:39:41,519 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-21 09:39:41,519 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-21 09:39:41,524 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-21 09:39:41,525 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-21 09:39:41,618 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-21 09:39:41,702 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,704 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:39:41,851 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:39:41,874 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_read_u8_harness.i[4497,4510] [2022-07-21 09:39:41,876 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_read_u8_harness.i[4557,4570] [2022-07-21 09:39:41,921 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,922 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,923 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,923 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,924 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,934 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,936 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,939 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,939 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:41,972 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-21 09:39:41,973 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-21 09:39:41,974 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-21 09:39:41,974 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-21 09:39:41,975 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-21 09:39:41,975 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-21 09:39:41,976 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-21 09:39:41,976 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-21 09:39:41,976 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-21 09:39:41,977 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-21 09:39:41,997 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-21 09:39:42,043 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:42,044 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:39:42,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:39:42,342 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:39:42,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:39:42 WrapperNode [2022-07-21 09:39:42,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:39:42,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:39:42,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:39:42,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:39:42,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:39:42" (1/1) ... [2022-07-21 09:39:42,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:39:42" (1/1) ... [2022-07-21 09:39:42,587 INFO L137 Inliner]: procedures = 690, calls = 2631, calls flagged for inlining = 61, calls inlined = 10, statements flattened = 959 [2022-07-21 09:39:42,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:39:42,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:39:42,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:39:42,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:39:42,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:39:42" (1/1) ... [2022-07-21 09:39:42,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:39:42" (1/1) ... [2022-07-21 09:39:42,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:39:42" (1/1) ... [2022-07-21 09:39:42,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:39:42" (1/1) ... [2022-07-21 09:39:42,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:39:42" (1/1) ... [2022-07-21 09:39:42,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:39:42" (1/1) ... [2022-07-21 09:39:42,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:39:42" (1/1) ... [2022-07-21 09:39:42,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:39:42,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:39:42,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:39:42,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:39:42,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:39:42" (1/1) ... [2022-07-21 09:39:42,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:39:42,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:39:42,774 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-21 09:39:42,798 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-21 09:39:42,815 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_read [2022-07-21 09:39:42,816 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_read [2022-07-21 09:39:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-21 09:39:42,816 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-21 09:39:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:39:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-21 09:39:42,817 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-21 09:39:42,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-07-21 09:39:42,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 09:39:42,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 09:39:42,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 09:39:42,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 09:39:42,819 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 09:39:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 09:39:42,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 09:39:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:39:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:39:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 09:39:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:39:42,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:39:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-21 09:39:42,820 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-21 09:39:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 09:39:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 09:39:42,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 09:39:42,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 09:39:42,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:39:42,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 09:39:42,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 09:39:42,822 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-21 09:39:42,823 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-21 09:39:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 09:39:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-07-21 09:39:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 09:39:43,087 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:39:43,089 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:39:44,120 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:39:44,132 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:39:44,132 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 09:39:44,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:39:44 BoogieIcfgContainer [2022-07-21 09:39:44,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:39:44,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:39:44,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:39:44,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:39:44,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:39:40" (1/3) ... [2022-07-21 09:39:44,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dcda6aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:39:44, skipping insertion in model container [2022-07-21 09:39:44,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:39:42" (2/3) ... [2022-07-21 09:39:44,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dcda6aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:39:44, skipping insertion in model container [2022-07-21 09:39:44,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:39:44" (3/3) ... [2022-07-21 09:39:44,142 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_read_u8_harness.i [2022-07-21 09:39:44,154 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:39:44,155 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:39:44,220 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:39:44,227 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@5f973641, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@66147e16 [2022-07-21 09:39:44,228 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 09:39:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 85 states have internal predecessors, (107), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-07-21 09:39:44,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-21 09:39:44,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:39:44,250 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 09:39:44,251 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:39:44,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:39:44,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1911600459, now seen corresponding path program 1 times [2022-07-21 09:39:44,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:39:44,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069410120] [2022-07-21 09:39:44,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:39:44,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:39:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:44,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:39:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:44,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:39:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:44,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:39:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:44,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:39:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:44,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 09:39:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:44,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 09:39:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:44,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 09:39:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:44,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:39:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:44,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:39:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:44,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:39:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:44,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:39:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:44,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:39:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:39:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:39:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 09:39:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 09:39:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2022-07-21 09:39:45,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:39:45,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069410120] [2022-07-21 09:39:45,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069410120] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:39:45,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:39:45,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:39:45,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491209718] [2022-07-21 09:39:45,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:39:45,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:39:45,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:39:45,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:39:45,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:39:45,122 INFO L87 Difference]: Start difference. First operand has 132 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 85 states have internal predecessors, (107), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 09:39:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:39:45,396 INFO L93 Difference]: Finished difference Result 261 states and 387 transitions. [2022-07-21 09:39:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:39:45,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2022-07-21 09:39:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:39:45,417 INFO L225 Difference]: With dead ends: 261 [2022-07-21 09:39:45,418 INFO L226 Difference]: Without dead ends: 126 [2022-07-21 09:39:45,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:39:45,432 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 38 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:39:45,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 233 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:39:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-21 09:39:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-21 09:39:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 79 states have (on average 1.240506329113924) internal successors, (98), 80 states have internal predecessors, (98), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-21 09:39:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 173 transitions. [2022-07-21 09:39:45,492 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 173 transitions. Word has length 107 [2022-07-21 09:39:45,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:39:45,492 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 173 transitions. [2022-07-21 09:39:45,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 09:39:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 173 transitions. [2022-07-21 09:39:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-21 09:39:45,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:39:45,502 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 09:39:45,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 09:39:45,503 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:39:45,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:39:45,503 INFO L85 PathProgramCache]: Analyzing trace with hash 856378377, now seen corresponding path program 1 times [2022-07-21 09:39:45,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:39:45,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424536275] [2022-07-21 09:39:45,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:39:45,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:39:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:39:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:39:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:39:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:39:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 09:39:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 09:39:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 09:39:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 09:39:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:39:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:39:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:39:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:39:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:39:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:39:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 09:39:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 09:39:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-07-21 09:39:45,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:39:45,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424536275] [2022-07-21 09:39:45,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424536275] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:39:45,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924498443] [2022-07-21 09:39:45,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:39:45,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:39:45,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:39:45,931 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-21 09:39:45,932 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-21 09:39:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:46,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 2664 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 09:39:46,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:39:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-07-21 09:39:46,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:39:46,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924498443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:39:46,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:39:46,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-07-21 09:39:46,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041387979] [2022-07-21 09:39:46,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:39:46,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:39:46,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:39:46,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:39:46,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:39:46,592 INFO L87 Difference]: Start difference. First operand 126 states and 173 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-21 09:39:46,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:39:46,778 INFO L93 Difference]: Finished difference Result 236 states and 335 transitions. [2022-07-21 09:39:46,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:39:46,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 107 [2022-07-21 09:39:46,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:39:46,782 INFO L225 Difference]: With dead ends: 236 [2022-07-21 09:39:46,782 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 09:39:46,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:39:46,784 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 194 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:39:46,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 362 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:39:46,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 09:39:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-21 09:39:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 83 states have internal predecessors, (100), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (45), 37 states have call predecessors, (45), 37 states have call successors, (45) [2022-07-21 09:39:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2022-07-21 09:39:46,799 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 107 [2022-07-21 09:39:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:39:46,800 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2022-07-21 09:39:46,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-21 09:39:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2022-07-21 09:39:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-21 09:39:46,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:39:46,802 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:39:46,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 09:39:47,023 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-21 09:39:47,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:39:47,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:39:47,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1509088892, now seen corresponding path program 1 times [2022-07-21 09:39:47,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:39:47,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681209221] [2022-07-21 09:39:47,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:39:47,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:39:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:39:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:39:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:39:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:39:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:39:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 09:39:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:39:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:39:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 09:39:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:39:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 09:39:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 09:39:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 09:39:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:39:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:39:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:39:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-21 09:39:47,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:39:47,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681209221] [2022-07-21 09:39:47,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681209221] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:39:47,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739409948] [2022-07-21 09:39:47,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:39:47,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:39:47,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:39:47,411 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-21 09:39:47,421 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-21 09:39:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:47,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 2669 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 09:39:47,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:39:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-21 09:39:48,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:39:48,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739409948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:39:48,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:39:48,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-07-21 09:39:48,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133790741] [2022-07-21 09:39:48,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:39:48,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:39:48,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:39:48,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:39:48,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-21 09:39:48,063 INFO L87 Difference]: Start difference. First operand 129 states and 183 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-21 09:39:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:39:48,359 INFO L93 Difference]: Finished difference Result 226 states and 322 transitions. [2022-07-21 09:39:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:39:48,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 109 [2022-07-21 09:39:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:39:48,362 INFO L225 Difference]: With dead ends: 226 [2022-07-21 09:39:48,362 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 09:39:48,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-07-21 09:39:48,364 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 207 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:39:48,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 583 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:39:48,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 09:39:48,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-21 09:39:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 83 states have internal predecessors, (100), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (43), 37 states have call predecessors, (43), 37 states have call successors, (43) [2022-07-21 09:39:48,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 181 transitions. [2022-07-21 09:39:48,378 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 181 transitions. Word has length 109 [2022-07-21 09:39:48,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:39:48,378 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 181 transitions. [2022-07-21 09:39:48,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-21 09:39:48,379 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 181 transitions. [2022-07-21 09:39:48,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-21 09:39:48,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:39:48,380 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 3, 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-21 09:39:48,407 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-21 09:39:48,598 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-21 09:39:48,599 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:39:48,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:39:48,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1446621481, now seen corresponding path program 2 times [2022-07-21 09:39:48,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:39:48,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128834725] [2022-07-21 09:39:48,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:39:48,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:39:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:48,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:39:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:48,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:39:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:48,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:39:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:48,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:39:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:48,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:39:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:48,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 09:39:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:48,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:39:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:48,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:39:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:48,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 09:39:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:48,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:39:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:48,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 09:39:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:49,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 09:39:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:49,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:39:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:49,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 09:39:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:49,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 09:39:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:49,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:39:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-21 09:39:49,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:39:49,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128834725] [2022-07-21 09:39:49,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128834725] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:39:49,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914445631] [2022-07-21 09:39:49,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:39:49,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:39:49,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:39:49,056 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-21 09:39:49,085 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-21 09:39:49,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 09:39:49,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:39:49,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 2674 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 09:39:49,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:39:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-21 09:39:49,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:39:49,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914445631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:39:49,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:39:49,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 12 [2022-07-21 09:39:49,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909123450] [2022-07-21 09:39:49,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:39:49,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:39:49,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:39:49,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:39:49,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-21 09:39:49,919 INFO L87 Difference]: Start difference. First operand 129 states and 181 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-07-21 09:39:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:39:50,076 INFO L93 Difference]: Finished difference Result 221 states and 311 transitions. [2022-07-21 09:39:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:39:50,077 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 111 [2022-07-21 09:39:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:39:50,079 INFO L225 Difference]: With dead ends: 221 [2022-07-21 09:39:50,079 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 09:39:50,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:39:50,081 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 107 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:39:50,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 898 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:39:50,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 09:39:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-21 09:39:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 83 states have internal predecessors, (100), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-07-21 09:39:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 178 transitions. [2022-07-21 09:39:50,094 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 178 transitions. Word has length 111 [2022-07-21 09:39:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:39:50,095 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 178 transitions. [2022-07-21 09:39:50,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-07-21 09:39:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 178 transitions. [2022-07-21 09:39:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-21 09:39:50,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:39:50,097 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:39:50,137 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-21 09:39:50,307 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-21 09:39:50,308 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:39:50,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:39:50,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1547321138, now seen corresponding path program 3 times [2022-07-21 09:39:50,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:39:50,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097479710] [2022-07-21 09:39:50,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:39:50,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:39:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:39:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:39:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:39:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:39:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:39:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 09:39:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:39:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:39:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 09:39:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:39:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 09:39:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:39:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:39:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 09:39:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 09:39:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 09:39:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-07-21 09:39:50,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:39:50,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097479710] [2022-07-21 09:39:50,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097479710] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:39:50,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796591375] [2022-07-21 09:39:50,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 09:39:50,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:39:50,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:39:50,744 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-21 09:39:50,745 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-21 09:39:51,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-21 09:39:51,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:39:51,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 2377 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 09:39:51,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:39:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-21 09:39:51,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:39:51,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796591375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:39:51,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:39:51,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2022-07-21 09:39:51,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752639992] [2022-07-21 09:39:51,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:39:51,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:39:51,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:39:51,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:39:51,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:39:51,289 INFO L87 Difference]: Start difference. First operand 129 states and 178 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-21 09:39:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:39:51,404 INFO L93 Difference]: Finished difference Result 216 states and 297 transitions. [2022-07-21 09:39:51,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:39:51,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 113 [2022-07-21 09:39:51,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:39:51,407 INFO L225 Difference]: With dead ends: 216 [2022-07-21 09:39:51,407 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 09:39:51,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-07-21 09:39:51,408 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 2 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:39:51,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 922 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:39:51,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 09:39:51,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-21 09:39:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 83 states have internal predecessors, (100), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 37 states have call predecessors, (39), 37 states have call successors, (39) [2022-07-21 09:39:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 177 transitions. [2022-07-21 09:39:51,428 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 177 transitions. Word has length 113 [2022-07-21 09:39:51,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:39:51,430 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 177 transitions. [2022-07-21 09:39:51,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-21 09:39:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 177 transitions. [2022-07-21 09:39:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-21 09:39:51,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:39:51,436 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:39:51,468 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-21 09:39:51,649 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-21 09:39:51,649 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:39:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:39:51,650 INFO L85 PathProgramCache]: Analyzing trace with hash -126288589, now seen corresponding path program 4 times [2022-07-21 09:39:51,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:39:51,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197745625] [2022-07-21 09:39:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:39:51,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:39:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:51,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:39:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:51,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:39:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:51,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:39:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:51,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:39:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:51,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:39:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:51,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 09:39:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:51,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:39:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:52,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:39:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:52,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 09:39:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:52,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:39:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:52,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 09:39:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:52,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:39:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:52,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:39:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:52,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 09:39:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:52,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 09:39:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:52,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 09:39:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-07-21 09:39:52,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:39:52,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197745625] [2022-07-21 09:39:52,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197745625] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:39:52,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16312843] [2022-07-21 09:39:52,104 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 09:39:52,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:39:52,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:39:52,105 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-21 09:39:52,107 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-21 09:39:52,589 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 09:39:52,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:39:52,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 2684 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 09:39:52,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:39:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 09:39:52,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:39:52,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16312843] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:39:52,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:39:52,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2022-07-21 09:39:52,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374326609] [2022-07-21 09:39:52,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:39:52,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 09:39:52,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:39:52,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 09:39:52,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2022-07-21 09:39:52,818 INFO L87 Difference]: Start difference. First operand 129 states and 177 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-07-21 09:39:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:39:53,287 INFO L93 Difference]: Finished difference Result 205 states and 277 transitions. [2022-07-21 09:39:53,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:39:53,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 115 [2022-07-21 09:39:53,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:39:53,289 INFO L225 Difference]: With dead ends: 205 [2022-07-21 09:39:53,289 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 09:39:53,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2022-07-21 09:39:53,291 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 263 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:39:53,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 779 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 09:39:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 09:39:53,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-21 09:39:53,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 83 states have internal predecessors, (100), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-07-21 09:39:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 176 transitions. [2022-07-21 09:39:53,303 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 176 transitions. Word has length 115 [2022-07-21 09:39:53,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:39:53,304 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 176 transitions. [2022-07-21 09:39:53,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-07-21 09:39:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 176 transitions. [2022-07-21 09:39:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-21 09:39:53,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:39:53,306 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 09:39:53,338 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-21 09:39:53,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:39:53,532 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:39:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:39:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1860935384, now seen corresponding path program 1 times [2022-07-21 09:39:53,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:39:53,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147883255] [2022-07-21 09:39:53,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:39:53,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:39:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:39:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:39:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:39:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:39:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:39:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 09:39:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:39:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:39:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 09:39:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:39:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 09:39:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:39:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:39:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 09:39:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 09:39:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 09:39:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-07-21 09:39:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:39:53,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147883255] [2022-07-21 09:39:53,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147883255] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:39:53,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:39:53,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 09:39:53,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729616064] [2022-07-21 09:39:53,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:39:53,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:39:53,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:39:53,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:39:53,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:39:53,919 INFO L87 Difference]: Start difference. First operand 129 states and 176 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-21 09:39:54,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:39:54,588 INFO L93 Difference]: Finished difference Result 141 states and 197 transitions. [2022-07-21 09:39:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:39:54,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2022-07-21 09:39:54,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:39:54,590 INFO L225 Difference]: With dead ends: 141 [2022-07-21 09:39:54,590 INFO L226 Difference]: Without dead ends: 139 [2022-07-21 09:39:54,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:39:54,591 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 57 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:39:54,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 815 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 09:39:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-21 09:39:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2022-07-21 09:39:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 90 states have internal predecessors, (106), 39 states have call successors, (39), 9 states have call predecessors, (39), 11 states have return successors, (49), 38 states have call predecessors, (49), 38 states have call successors, (49) [2022-07-21 09:39:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 194 transitions. [2022-07-21 09:39:54,602 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 194 transitions. Word has length 117 [2022-07-21 09:39:54,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:39:54,603 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 194 transitions. [2022-07-21 09:39:54,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-21 09:39:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 194 transitions. [2022-07-21 09:39:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-21 09:39:54,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:39:54,604 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:39:54,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 09:39:54,605 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:39:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:39:54,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1848112160, now seen corresponding path program 1 times [2022-07-21 09:39:54,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:39:54,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529162673] [2022-07-21 09:39:54,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:39:54,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:39:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:54,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:39:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:54,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:39:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:54,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:39:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:54,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:39:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:54,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:39:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:54,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 09:39:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:54,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:39:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:54,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:39:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:54,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 09:39:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:54,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:39:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:55,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 09:39:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:55,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:39:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:55,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:39:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:55,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 09:39:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:55,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 09:39:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:55,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 09:39:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-21 09:39:55,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:39:55,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529162673] [2022-07-21 09:39:55,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529162673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:39:55,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598145673] [2022-07-21 09:39:55,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:39:55,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:39:55,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:39:55,044 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-21 09:39:55,072 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-21 09:39:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:55,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 2701 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-21 09:39:55,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:39:55,620 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-21 09:39:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-21 09:39:55,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:39:55,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598145673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:39:55,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:39:55,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 18 [2022-07-21 09:39:55,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048279409] [2022-07-21 09:39:55,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:39:55,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 09:39:55,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:39:55,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 09:39:55,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:39:56,000 INFO L87 Difference]: Start difference. First operand 138 states and 194 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-21 09:39:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:39:56,480 INFO L93 Difference]: Finished difference Result 261 states and 367 transitions. [2022-07-21 09:39:56,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 09:39:56,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 121 [2022-07-21 09:39:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:39:56,482 INFO L225 Difference]: With dead ends: 261 [2022-07-21 09:39:56,483 INFO L226 Difference]: Without dead ends: 138 [2022-07-21 09:39:56,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-07-21 09:39:56,484 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 62 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:39:56,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 879 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 59 Unchecked, 0.4s Time] [2022-07-21 09:39:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-21 09:39:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-07-21 09:39:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 90 states have internal predecessors, (106), 39 states have call successors, (39), 9 states have call predecessors, (39), 11 states have return successors, (48), 38 states have call predecessors, (48), 38 states have call successors, (48) [2022-07-21 09:39:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 193 transitions. [2022-07-21 09:39:56,494 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 193 transitions. Word has length 121 [2022-07-21 09:39:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:39:56,494 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 193 transitions. [2022-07-21 09:39:56,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-21 09:39:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 193 transitions. [2022-07-21 09:39:56,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-21 09:39:56,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:39:56,496 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 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] [2022-07-21 09:39:56,526 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-21 09:39:56,715 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-21 09:39:56,716 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:39:56,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:39:56,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1143204392, now seen corresponding path program 2 times [2022-07-21 09:39:56,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:39:56,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682654184] [2022-07-21 09:39:56,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:39:56,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:39:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:56,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:39:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:56,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:39:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:56,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:39:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:56,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:39:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:56,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 09:39:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:57,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 09:39:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:57,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:39:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:57,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:39:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:57,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:39:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:57,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:39:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:57,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 09:39:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:57,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:39:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 09:39:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:57,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 09:39:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:57,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:39:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:57,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 09:39:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 3 proven. 38 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-07-21 09:39:57,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:39:57,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682654184] [2022-07-21 09:39:57,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682654184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:39:57,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541679027] [2022-07-21 09:39:57,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:39:57,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:39:57,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:39:57,096 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-21 09:39:57,104 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-21 09:39:58,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 09:39:58,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:39:58,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 2713 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 09:39:58,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:39:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-21 09:39:58,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:39:58,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541679027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:39:58,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:39:58,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-07-21 09:39:58,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507130659] [2022-07-21 09:39:58,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:39:58,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:39:58,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:39:58,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:39:58,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:39:58,522 INFO L87 Difference]: Start difference. First operand 138 states and 193 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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-21 09:39:58,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:39:58,690 INFO L93 Difference]: Finished difference Result 262 states and 377 transitions. [2022-07-21 09:39:58,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:39:58,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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 125 [2022-07-21 09:39:58,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:39:58,693 INFO L225 Difference]: With dead ends: 262 [2022-07-21 09:39:58,693 INFO L226 Difference]: Without dead ends: 143 [2022-07-21 09:39:58,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:39:58,694 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 12 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:39:58,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1273 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:39:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-21 09:39:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-07-21 09:39:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 91 states have (on average 1.2087912087912087) internal successors, (110), 95 states have internal predecessors, (110), 39 states have call successors, (39), 9 states have call predecessors, (39), 12 states have return successors, (57), 38 states have call predecessors, (57), 38 states have call successors, (57) [2022-07-21 09:39:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2022-07-21 09:39:58,706 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 125 [2022-07-21 09:39:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:39:58,707 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2022-07-21 09:39:58,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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-21 09:39:58,707 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2022-07-21 09:39:58,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-21 09:39:58,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:39:58,709 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:39:58,746 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-21 09:39:58,935 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-21 09:39:58,936 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:39:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:39:58,936 INFO L85 PathProgramCache]: Analyzing trace with hash -898461391, now seen corresponding path program 1 times [2022-07-21 09:39:58,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:39:58,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825561856] [2022-07-21 09:39:58,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:39:58,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:39:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:39:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:39:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:39:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:39:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 09:39:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:39:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:39:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:39:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:39:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 09:39:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 09:39:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:39:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 09:39:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 09:39:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 09:39:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 09:39:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:39:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-07-21 09:39:59,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:39:59,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825561856] [2022-07-21 09:39:59,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825561856] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:39:59,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261081114] [2022-07-21 09:39:59,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:39:59,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:39:59,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:39:59,539 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-21 09:39:59,541 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-21 09:40:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:00,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 2723 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-21 09:40:00,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:40:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 108 proven. 17 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-07-21 09:40:01,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:40:01,877 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-21 09:40:02,018 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-21 09:40:02,018 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-21 09:40:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-07-21 09:40:02,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261081114] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:40:02,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:40:02,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 28 [2022-07-21 09:40:02,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160320213] [2022-07-21 09:40:02,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:40:02,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-21 09:40:02,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:40:02,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-21 09:40:02,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2022-07-21 09:40:02,041 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 28 states, 26 states have (on average 4.5) internal successors, (117), 25 states have internal predecessors, (117), 11 states have call successors, (41), 6 states have call predecessors, (41), 6 states have return successors, (37), 9 states have call predecessors, (37), 11 states have call successors, (37) [2022-07-21 09:40:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:40:05,002 INFO L93 Difference]: Finished difference Result 359 states and 557 transitions. [2022-07-21 09:40:05,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-21 09:40:05,002 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 4.5) internal successors, (117), 25 states have internal predecessors, (117), 11 states have call successors, (41), 6 states have call predecessors, (41), 6 states have return successors, (37), 9 states have call predecessors, (37), 11 states have call successors, (37) Word has length 127 [2022-07-21 09:40:05,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:40:05,005 INFO L225 Difference]: With dead ends: 359 [2022-07-21 09:40:05,005 INFO L226 Difference]: Without dead ends: 232 [2022-07-21 09:40:05,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 248 SyntacticMatches, 23 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=269, Invalid=1987, Unknown=0, NotChecked=0, Total=2256 [2022-07-21 09:40:05,008 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 178 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:40:05,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1474 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1655 Invalid, 0 Unknown, 273 Unchecked, 2.3s Time] [2022-07-21 09:40:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-21 09:40:05,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 177. [2022-07-21 09:40:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 115 states have internal predecessors, (130), 52 states have call successors, (52), 13 states have call predecessors, (52), 13 states have return successors, (74), 48 states have call predecessors, (74), 51 states have call successors, (74) [2022-07-21 09:40:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 256 transitions. [2022-07-21 09:40:05,043 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 256 transitions. Word has length 127 [2022-07-21 09:40:05,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:40:05,043 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 256 transitions. [2022-07-21 09:40:05,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 4.5) internal successors, (117), 25 states have internal predecessors, (117), 11 states have call successors, (41), 6 states have call predecessors, (41), 6 states have return successors, (37), 9 states have call predecessors, (37), 11 states have call successors, (37) [2022-07-21 09:40:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 256 transitions. [2022-07-21 09:40:05,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-21 09:40:05,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:40:05,046 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:40:05,076 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-21 09:40:05,262 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,SelfDestructingSolverStorable9 [2022-07-21 09:40:05,262 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:40:05,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:40:05,263 INFO L85 PathProgramCache]: Analyzing trace with hash 66408255, now seen corresponding path program 1 times [2022-07-21 09:40:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:40:05,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489109809] [2022-07-21 09:40:05,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:40:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:40:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:40:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:40:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:40:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:40:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 09:40:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:40:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:40:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:40:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:40:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 09:40:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:40:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 09:40:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 09:40:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 09:40:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:40:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 09:40:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 09:40:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2022-07-21 09:40:05,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:40:05,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489109809] [2022-07-21 09:40:05,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489109809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:40:05,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:40:05,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:40:05,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668057381] [2022-07-21 09:40:05,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:40:05,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:40:05,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:40:05,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:40:05,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:40:05,602 INFO L87 Difference]: Start difference. First operand 177 states and 256 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-07-21 09:40:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:40:06,342 INFO L93 Difference]: Finished difference Result 331 states and 489 transitions. [2022-07-21 09:40:06,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:40:06,343 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 134 [2022-07-21 09:40:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:40:06,344 INFO L225 Difference]: With dead ends: 331 [2022-07-21 09:40:06,344 INFO L226 Difference]: Without dead ends: 203 [2022-07-21 09:40:06,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:40:06,346 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 149 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:40:06,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 593 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 09:40:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-21 09:40:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 177. [2022-07-21 09:40:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 111 states have (on average 1.162162162162162) internal successors, (129), 115 states have internal predecessors, (129), 52 states have call successors, (52), 13 states have call predecessors, (52), 13 states have return successors, (74), 48 states have call predecessors, (74), 51 states have call successors, (74) [2022-07-21 09:40:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 255 transitions. [2022-07-21 09:40:06,376 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 255 transitions. Word has length 134 [2022-07-21 09:40:06,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:40:06,376 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 255 transitions. [2022-07-21 09:40:06,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-07-21 09:40:06,377 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 255 transitions. [2022-07-21 09:40:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-21 09:40:06,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:40:06,381 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:40:06,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 09:40:06,381 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:40:06,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:40:06,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2019042026, now seen corresponding path program 1 times [2022-07-21 09:40:06,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:40:06,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196925488] [2022-07-21 09:40:06,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:40:06,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:40:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:06,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:40:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:06,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:40:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:06,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:40:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:06,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:40:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:06,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:40:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:06,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:40:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:06,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:40:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:06,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:40:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:06,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:40:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:06,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:40:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:06,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:40:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:06,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:40:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:06,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:40:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:06,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 09:40:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:07,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:40:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:07,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:40:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:07,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:40:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:07,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 09:40:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:07,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 09:40:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 34 proven. 11 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2022-07-21 09:40:07,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:40:07,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196925488] [2022-07-21 09:40:07,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196925488] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:40:07,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211883955] [2022-07-21 09:40:07,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:40:07,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:40:07,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:40:07,204 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-21 09:40:07,231 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-21 09:40:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:07,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 2805 conjuncts, 87 conjunts are in the unsatisfiable core [2022-07-21 09:40:07,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:40:07,682 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-21 09:40:07,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 09:40:07,795 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:40:07,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 09:40:07,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 09:40:07,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:40:07,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 09:40:08,744 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 09:40:08,745 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 15 treesize of output 15 [2022-07-21 09:40:08,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 09:40:12,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 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 09:40:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 148 proven. 87 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-21 09:40:38,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:40:38,532 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_821) |c_ULTIMATE.start_aws_byte_cursor_read_u8_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_read_u8_harness_~#cur~3#1.offset|) 18446744073709551616) 0))) is different from false [2022-07-21 09:40:38,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211883955] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:40:38,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:40:38,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 44 [2022-07-21 09:40:38,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466705236] [2022-07-21 09:40:38,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:40:38,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-21 09:40:38,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:40:38,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-21 09:40:38,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2272, Unknown=3, NotChecked=96, Total=2550 [2022-07-21 09:40:38,543 INFO L87 Difference]: Start difference. First operand 177 states and 255 transitions. Second operand has 44 states, 41 states have (on average 3.1707317073170733) internal successors, (130), 40 states have internal predecessors, (130), 18 states have call successors, (38), 10 states have call predecessors, (38), 12 states have return successors, (35), 16 states have call predecessors, (35), 18 states have call successors, (35) [2022-07-21 09:40:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:40:45,400 INFO L93 Difference]: Finished difference Result 377 states and 556 transitions. [2022-07-21 09:40:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-21 09:40:45,401 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 3.1707317073170733) internal successors, (130), 40 states have internal predecessors, (130), 18 states have call successors, (38), 10 states have call predecessors, (38), 12 states have return successors, (35), 16 states have call predecessors, (35), 18 states have call successors, (35) Word has length 145 [2022-07-21 09:40:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:40:45,403 INFO L225 Difference]: With dead ends: 377 [2022-07-21 09:40:45,403 INFO L226 Difference]: Without dead ends: 255 [2022-07-21 09:40:45,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 218 SyntacticMatches, 22 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2073 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=441, Invalid=5721, Unknown=4, NotChecked=154, Total=6320 [2022-07-21 09:40:45,406 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 205 mSDsluCounter, 2138 mSDsCounter, 0 mSdLazyCounter, 2899 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 4703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 2899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1648 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-21 09:40:45,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 2314 Invalid, 4703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 2899 Invalid, 0 Unknown, 1648 Unchecked, 3.8s Time] [2022-07-21 09:40:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-21 09:40:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 205. [2022-07-21 09:40:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 135 states have (on average 1.1555555555555554) internal successors, (156), 139 states have internal predecessors, (156), 52 states have call successors, (52), 17 states have call predecessors, (52), 17 states have return successors, (72), 48 states have call predecessors, (72), 51 states have call successors, (72) [2022-07-21 09:40:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 280 transitions. [2022-07-21 09:40:45,447 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 280 transitions. Word has length 145 [2022-07-21 09:40:45,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:40:45,448 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 280 transitions. [2022-07-21 09:40:45,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 3.1707317073170733) internal successors, (130), 40 states have internal predecessors, (130), 18 states have call successors, (38), 10 states have call predecessors, (38), 12 states have return successors, (35), 16 states have call predecessors, (35), 18 states have call successors, (35) [2022-07-21 09:40:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 280 transitions. [2022-07-21 09:40:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-21 09:40:45,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:40:45,450 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-21 09:40:45,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-21 09:40:45,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:40:45,671 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:40:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:40:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1111968247, now seen corresponding path program 1 times [2022-07-21 09:40:45,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:40:45,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769797885] [2022-07-21 09:40:45,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:40:45,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:40:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:40:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:40:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:40:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:40:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:40:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:40:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:40:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:40:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:40:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:40:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:40:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:40:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:40:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:40:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 09:40:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 09:40:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 09:40:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 09:40:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 09:40:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 34 proven. 16 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2022-07-21 09:40:46,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:40:46,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769797885] [2022-07-21 09:40:46,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769797885] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:40:46,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657837699] [2022-07-21 09:40:46,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:40:46,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:40:46,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:40:46,221 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-21 09:40:46,223 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-21 09:40:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:46,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 2851 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 09:40:46,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:40:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-21 09:40:46,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:40:46,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657837699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:40:46,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:40:46,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-07-21 09:40:46,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682753922] [2022-07-21 09:40:46,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:40:46,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:40:46,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:40:46,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:40:46,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:40:46,750 INFO L87 Difference]: Start difference. First operand 205 states and 280 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-21 09:40:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:40:46,913 INFO L93 Difference]: Finished difference Result 329 states and 452 transitions. [2022-07-21 09:40:46,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:40:46,914 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 159 [2022-07-21 09:40:46,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:40:46,916 INFO L225 Difference]: With dead ends: 329 [2022-07-21 09:40:46,916 INFO L226 Difference]: Without dead ends: 205 [2022-07-21 09:40:46,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:40:46,918 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 11 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:40:46,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1261 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:40:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-21 09:40:46,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-07-21 09:40:46,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 135 states have (on average 1.1555555555555554) internal successors, (156), 139 states have internal predecessors, (156), 52 states have call successors, (52), 17 states have call predecessors, (52), 17 states have return successors, (70), 48 states have call predecessors, (70), 51 states have call successors, (70) [2022-07-21 09:40:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 278 transitions. [2022-07-21 09:40:46,939 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 278 transitions. Word has length 159 [2022-07-21 09:40:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:40:46,939 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 278 transitions. [2022-07-21 09:40:46,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-21 09:40:46,940 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 278 transitions. [2022-07-21 09:40:46,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-21 09:40:46,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:40:46,942 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 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-21 09:40:46,975 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-21 09:40:47,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 09:40:47,157 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:40:47,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:40:47,157 INFO L85 PathProgramCache]: Analyzing trace with hash 501632720, now seen corresponding path program 1 times [2022-07-21 09:40:47,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:40:47,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537117572] [2022-07-21 09:40:47,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:40:47,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:40:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:40:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:40:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:40:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:40:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 09:40:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:40:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:40:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:40:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:40:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:40:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 09:40:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 09:40:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:40:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 09:40:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 09:40:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:40:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2022-07-21 09:40:47,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:40:47,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537117572] [2022-07-21 09:40:47,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537117572] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:40:47,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504938577] [2022-07-21 09:40:47,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:40:47,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:40:47,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:40:47,568 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-21 09:40:47,570 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-21 09:40:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:48,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 2769 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 09:40:48,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:40:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-21 09:40:48,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:40:48,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504938577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:40:48,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:40:48,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-07-21 09:40:48,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856243014] [2022-07-21 09:40:48,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:40:48,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:40:48,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:40:48,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:40:48,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:40:48,139 INFO L87 Difference]: Start difference. First operand 205 states and 278 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 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-21 09:40:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:40:48,303 INFO L93 Difference]: Finished difference Result 327 states and 445 transitions. [2022-07-21 09:40:48,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:40:48,304 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 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 141 [2022-07-21 09:40:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:40:48,308 INFO L225 Difference]: With dead ends: 327 [2022-07-21 09:40:48,308 INFO L226 Difference]: Without dead ends: 205 [2022-07-21 09:40:48,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:40:48,310 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 11 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:40:48,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1261 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:40:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-21 09:40:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-07-21 09:40:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 135 states have (on average 1.1555555555555554) internal successors, (156), 139 states have internal predecessors, (156), 52 states have call successors, (52), 17 states have call predecessors, (52), 17 states have return successors, (67), 48 states have call predecessors, (67), 51 states have call successors, (67) [2022-07-21 09:40:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 275 transitions. [2022-07-21 09:40:48,328 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 275 transitions. Word has length 141 [2022-07-21 09:40:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:40:48,329 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 275 transitions. [2022-07-21 09:40:48,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 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-21 09:40:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 275 transitions. [2022-07-21 09:40:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-21 09:40:48,331 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:40:48,332 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-21 09:40:48,367 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-21 09:40:48,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-21 09:40:48,555 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:40:48,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:40:48,556 INFO L85 PathProgramCache]: Analyzing trace with hash -198769456, now seen corresponding path program 2 times [2022-07-21 09:40:48,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:40:48,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133749972] [2022-07-21 09:40:48,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:40:48,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:40:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:48,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:40:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:48,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:40:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:48,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:40:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:48,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:40:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:48,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:40:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:48,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:40:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:48,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:40:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:48,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:40:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:48,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:40:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:48,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:40:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:48,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:40:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:48,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:40:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:48,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:40:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:49,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:40:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:49,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:40:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:49,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:40:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:49,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:40:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:49,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 09:40:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:49,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 09:40:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 45 proven. 5 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2022-07-21 09:40:49,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:40:49,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133749972] [2022-07-21 09:40:49,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133749972] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:40:49,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704915146] [2022-07-21 09:40:49,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:40:49,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:40:49,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:40:49,107 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-21 09:40:49,109 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-21 09:40:50,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 09:40:50,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:40:50,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 2861 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 09:40:50,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:40:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-07-21 09:40:50,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:40:50,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704915146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:40:50,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:40:50,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-07-21 09:40:50,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713966847] [2022-07-21 09:40:50,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:40:50,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:40:50,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:40:50,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:40:50,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:40:50,815 INFO L87 Difference]: Start difference. First operand 205 states and 275 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, (20), 2 states have call predecessors, (20), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-21 09:40:50,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:40:50,982 INFO L93 Difference]: Finished difference Result 306 states and 417 transitions. [2022-07-21 09:40:50,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:40:50,983 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, (20), 2 states have call predecessors, (20), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 161 [2022-07-21 09:40:50,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:40:50,984 INFO L225 Difference]: With dead ends: 306 [2022-07-21 09:40:50,985 INFO L226 Difference]: Without dead ends: 205 [2022-07-21 09:40:50,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:40:50,986 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 11 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:40:50,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1262 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:40:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-21 09:40:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-07-21 09:40:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 135 states have (on average 1.1555555555555554) internal successors, (156), 139 states have internal predecessors, (156), 52 states have call successors, (52), 17 states have call predecessors, (52), 17 states have return successors, (65), 48 states have call predecessors, (65), 51 states have call successors, (65) [2022-07-21 09:40:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 273 transitions. [2022-07-21 09:40:51,004 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 273 transitions. Word has length 161 [2022-07-21 09:40:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:40:51,005 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 273 transitions. [2022-07-21 09:40:51,005 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, (20), 2 states have call predecessors, (20), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-21 09:40:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 273 transitions. [2022-07-21 09:40:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-21 09:40:51,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:40:51,007 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:40:51,043 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-21 09:40:51,223 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,SelfDestructingSolverStorable14 [2022-07-21 09:40:51,223 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:40:51,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:40:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1785682142, now seen corresponding path program 2 times [2022-07-21 09:40:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:40:51,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131402704] [2022-07-21 09:40:51,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:40:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:40:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:40:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:40:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:40:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:40:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 09:40:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:40:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:40:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:40:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:40:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 09:40:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:40:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 09:40:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:40:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:40:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 09:40:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 09:40:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-07-21 09:40:51,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:40:51,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131402704] [2022-07-21 09:40:51,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131402704] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:40:51,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515373888] [2022-07-21 09:40:51,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:40:51,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:40:51,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:40:51,876 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-21 09:40:51,878 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-21 09:40:52,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 09:40:52,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:40:52,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 2789 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-21 09:40:52,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:40:52,836 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-21 09:40:52,841 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-21 09:40:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-07-21 09:40:53,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:40:53,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515373888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:40:53,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:40:53,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 23 [2022-07-21 09:40:53,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21230558] [2022-07-21 09:40:53,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:40:53,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 09:40:53,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:40:53,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 09:40:53,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-07-21 09:40:53,289 INFO L87 Difference]: Start difference. First operand 205 states and 273 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-07-21 09:40:53,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:40:53,407 INFO L93 Difference]: Finished difference Result 362 states and 479 transitions. [2022-07-21 09:40:53,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 09:40:53,407 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 145 [2022-07-21 09:40:53,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:40:53,409 INFO L225 Difference]: With dead ends: 362 [2022-07-21 09:40:53,409 INFO L226 Difference]: Without dead ends: 210 [2022-07-21 09:40:53,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-07-21 09:40:53,411 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 75 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:40:53,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 594 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 44 Invalid, 0 Unknown, 71 Unchecked, 0.1s Time] [2022-07-21 09:40:53,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-21 09:40:53,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2022-07-21 09:40:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 139 states have (on average 1.1510791366906474) internal successors, (160), 142 states have internal predecessors, (160), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (65), 48 states have call predecessors, (65), 51 states have call successors, (65) [2022-07-21 09:40:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 277 transitions. [2022-07-21 09:40:53,430 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 277 transitions. Word has length 145 [2022-07-21 09:40:53,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:40:53,431 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 277 transitions. [2022-07-21 09:40:53,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-07-21 09:40:53,431 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 277 transitions. [2022-07-21 09:40:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-21 09:40:53,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:40:53,433 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 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] [2022-07-21 09:40:53,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-21 09:40:53,647 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,SelfDestructingSolverStorable15 [2022-07-21 09:40:53,647 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:40:53,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:40:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1788038743, now seen corresponding path program 3 times [2022-07-21 09:40:53,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:40:53,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806818910] [2022-07-21 09:40:53,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:40:53,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:40:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:40:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:40:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:40:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:40:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:40:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:40:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:40:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:40:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:40:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:40:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:40:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:40:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:40:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:40:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:40:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:40:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:40:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:40:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 09:40:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 36 proven. 10 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-21 09:40:54,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:40:54,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806818910] [2022-07-21 09:40:54,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806818910] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:40:54,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526183758] [2022-07-21 09:40:54,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 09:40:54,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:40:54,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:40:54,234 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-21 09:40:54,265 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-21 09:40:55,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 09:40:55,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:40:55,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 2579 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-21 09:40:55,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:40:55,582 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 45 treesize of output 29 [2022-07-21 09:40:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 191 proven. 12 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-21 09:40:55,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:40:55,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-07-21 09:40:55,960 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-21 09:40:55,961 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-21 09:40:56,027 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-21 09:40:56,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526183758] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:40:56,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:40:56,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 20 [2022-07-21 09:40:56,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022056357] [2022-07-21 09:40:56,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:40:56,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 09:40:56,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:40:56,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 09:40:56,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-07-21 09:40:56,030 INFO L87 Difference]: Start difference. First operand 209 states and 277 transitions. Second operand has 20 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 9 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (29), 7 states have call predecessors, (29), 9 states have call successors, (29) [2022-07-21 09:40:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:40:58,320 INFO L93 Difference]: Finished difference Result 360 states and 500 transitions. [2022-07-21 09:40:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 09:40:58,321 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 9 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (29), 7 states have call predecessors, (29), 9 states have call successors, (29) Word has length 163 [2022-07-21 09:40:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:40:58,323 INFO L225 Difference]: With dead ends: 360 [2022-07-21 09:40:58,323 INFO L226 Difference]: Without dead ends: 258 [2022-07-21 09:40:58,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 349 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2022-07-21 09:40:58,325 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 124 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:40:58,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1116 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1321 Invalid, 0 Unknown, 137 Unchecked, 2.0s Time] [2022-07-21 09:40:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-21 09:40:58,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 215. [2022-07-21 09:40:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 144 states have (on average 1.1388888888888888) internal successors, (164), 147 states have internal predecessors, (164), 51 states have call successors, (51), 20 states have call predecessors, (51), 19 states have return successors, (64), 47 states have call predecessors, (64), 50 states have call successors, (64) [2022-07-21 09:40:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 279 transitions. [2022-07-21 09:40:58,355 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 279 transitions. Word has length 163 [2022-07-21 09:40:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:40:58,356 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 279 transitions. [2022-07-21 09:40:58,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 9 states have call successors, (33), 6 states have call predecessors, (33), 4 states have return successors, (29), 7 states have call predecessors, (29), 9 states have call successors, (29) [2022-07-21 09:40:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 279 transitions. [2022-07-21 09:40:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-21 09:40:58,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:40:58,358 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:40:58,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-21 09:40:58,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:40:58,581 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:40:58,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:40:58,581 INFO L85 PathProgramCache]: Analyzing trace with hash -27093342, now seen corresponding path program 1 times [2022-07-21 09:40:58,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:40:58,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550044308] [2022-07-21 09:40:58,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:40:58,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:40:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:40:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:40:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:40:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 09:40:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 09:40:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:40:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:40:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:40:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:40:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 09:40:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:40:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 09:40:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:40:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:40:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 09:40:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 09:40:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2022-07-21 09:40:58,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:40:58,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550044308] [2022-07-21 09:40:58,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550044308] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:40:58,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011002509] [2022-07-21 09:40:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:40:58,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:40:58,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:40:58,811 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-21 09:40:58,814 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-21 09:40:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:40:59,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 2787 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:40:59,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:40:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-21 09:40:59,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:40:59,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011002509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:40:59,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:40:59,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-21 09:40:59,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586459228] [2022-07-21 09:40:59,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:40:59,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:40:59,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:40:59,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:40:59,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:40:59,329 INFO L87 Difference]: Start difference. First operand 215 states and 279 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 09:40:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:40:59,363 INFO L93 Difference]: Finished difference Result 391 states and 523 transitions. [2022-07-21 09:40:59,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:40:59,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2022-07-21 09:40:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:40:59,366 INFO L225 Difference]: With dead ends: 391 [2022-07-21 09:40:59,366 INFO L226 Difference]: Without dead ends: 199 [2022-07-21 09:40:59,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:40:59,368 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 6 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:40:59,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 506 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:40:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-21 09:40:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2022-07-21 09:40:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 132 states have (on average 1.1363636363636365) internal successors, (150), 135 states have internal predecessors, (150), 45 states have call successors, (45), 18 states have call predecessors, (45), 18 states have return successors, (58), 42 states have call predecessors, (58), 44 states have call successors, (58) [2022-07-21 09:40:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 253 transitions. [2022-07-21 09:40:59,386 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 253 transitions. Word has length 145 [2022-07-21 09:40:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:40:59,386 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 253 transitions. [2022-07-21 09:40:59,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 09:40:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 253 transitions. [2022-07-21 09:40:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-21 09:40:59,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:40:59,389 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 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] [2022-07-21 09:40:59,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-21 09:40:59,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 09:40:59,616 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:40:59,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:40:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash -512783847, now seen corresponding path program 1 times [2022-07-21 09:40:59,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:40:59,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557708010] [2022-07-21 09:40:59,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:40:59,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:40:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:41:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:41:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:41:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:41:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:41:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:41:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:41:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:41:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:41:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:41:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:00,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 09:41:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 62 proven. 36 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-07-21 09:41:01,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:01,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557708010] [2022-07-21 09:41:01,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557708010] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:41:01,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427585494] [2022-07-21 09:41:01,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:01,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:41:01,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:41:01,031 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-21 09:41:01,032 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-21 09:41:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:01,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 2874 conjuncts, 124 conjunts are in the unsatisfiable core [2022-07-21 09:41:01,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:41:01,540 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-21 09:41:01,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 09:41:01,684 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:41:01,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 09:41:02,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 09:41:02,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:41:02,152 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 09:41:02,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2022-07-21 09:41:02,339 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-21 09:41:03,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:41:03,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:41:03,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:41:03,708 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-21 09:41:03,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 51 [2022-07-21 09:41:03,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2022-07-21 09:41:04,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2022-07-21 09:41:06,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:41:06,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:41:06,777 INFO L356 Elim1Store]: treesize reduction 66, result has 35.3 percent of original size [2022-07-21 09:41:06,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 53 [2022-07-21 09:41:07,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:41:07,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:41:07,560 INFO L356 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-07-21 09:41:07,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2022-07-21 09:41:07,617 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 32 treesize of output 30 [2022-07-21 09:41:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 72 proven. 165 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-21 09:41:22,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:41:22,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1493 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_aws_byte_cursor_read_aws_byte_cursor_advance_nospec_~#rv~7#1.base| v_ArrVal_1493) |c_aws_byte_cursor_read_aws_byte_cursor_advance_nospec_~cursor#1.base|) (+ |c_aws_byte_cursor_read_aws_byte_cursor_advance_nospec_~cursor#1.offset| 8)) 0))) is different from false [2022-07-21 09:41:22,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427585494] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:41:22,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:41:22,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2022-07-21 09:41:22,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108614511] [2022-07-21 09:41:22,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:41:22,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-21 09:41:22,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:22,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-21 09:41:22,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3548, Unknown=4, NotChecked=120, Total=3906 [2022-07-21 09:41:22,696 INFO L87 Difference]: Start difference. First operand 196 states and 253 transitions. Second operand has 56 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 48 states have internal predecessors, (127), 22 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (37), 20 states have call predecessors, (37), 21 states have call successors, (37) [2022-07-21 09:41:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:31,908 INFO L93 Difference]: Finished difference Result 377 states and 500 transitions. [2022-07-21 09:41:31,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-07-21 09:41:31,909 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 48 states have internal predecessors, (127), 22 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (37), 20 states have call predecessors, (37), 21 states have call successors, (37) Word has length 163 [2022-07-21 09:41:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:31,911 INFO L225 Difference]: With dead ends: 377 [2022-07-21 09:41:31,911 INFO L226 Difference]: Without dead ends: 272 [2022-07-21 09:41:31,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 176 SyntacticMatches, 27 SemanticMatches, 120 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4876 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=801, Invalid=13718, Unknown=5, NotChecked=238, Total=14762 [2022-07-21 09:41:31,916 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 133 mSDsluCounter, 3317 mSDsCounter, 0 mSdLazyCounter, 2731 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 3521 SdHoareTripleChecker+Invalid, 4269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1441 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:31,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 3521 Invalid, 4269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2731 Invalid, 0 Unknown, 1441 Unchecked, 4.2s Time] [2022-07-21 09:41:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-21 09:41:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 259. [2022-07-21 09:41:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 174 states have (on average 1.1264367816091954) internal successors, (196), 175 states have internal predecessors, (196), 61 states have call successors, (61), 24 states have call predecessors, (61), 23 states have return successors, (81), 59 states have call predecessors, (81), 60 states have call successors, (81) [2022-07-21 09:41:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 338 transitions. [2022-07-21 09:41:31,943 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 338 transitions. Word has length 163 [2022-07-21 09:41:31,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:31,944 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 338 transitions. [2022-07-21 09:41:31,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 48 states have internal predecessors, (127), 22 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (37), 20 states have call predecessors, (37), 21 states have call successors, (37) [2022-07-21 09:41:31,944 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 338 transitions. [2022-07-21 09:41:31,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-21 09:41:31,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:31,946 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 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] [2022-07-21 09:41:31,980 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-21 09:41:32,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:41:32,163 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:32,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:32,163 INFO L85 PathProgramCache]: Analyzing trace with hash 939790165, now seen corresponding path program 1 times [2022-07-21 09:41:32,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:32,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839739549] [2022-07-21 09:41:32,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:32,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:41:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:41:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:41:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:41:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:41:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:41:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:41:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:41:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:41:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:32,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:41:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:33,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:33,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 09:41:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2022-07-21 09:41:33,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:33,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839739549] [2022-07-21 09:41:33,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839739549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:33,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:33,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-21 09:41:33,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109041577] [2022-07-21 09:41:33,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:33,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 09:41:33,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:33,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 09:41:33,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-21 09:41:33,125 INFO L87 Difference]: Start difference. First operand 259 states and 338 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 7 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-21 09:41:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:35,069 INFO L93 Difference]: Finished difference Result 383 states and 535 transitions. [2022-07-21 09:41:35,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 09:41:35,070 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 7 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 166 [2022-07-21 09:41:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:35,072 INFO L225 Difference]: With dead ends: 383 [2022-07-21 09:41:35,072 INFO L226 Difference]: Without dead ends: 296 [2022-07-21 09:41:35,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2022-07-21 09:41:35,074 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 199 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:35,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 868 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 09:41:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-07-21 09:41:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 261. [2022-07-21 09:41:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 175 states have (on average 1.1257142857142857) internal successors, (197), 177 states have internal predecessors, (197), 62 states have call successors, (62), 24 states have call predecessors, (62), 23 states have return successors, (82), 59 states have call predecessors, (82), 61 states have call successors, (82) [2022-07-21 09:41:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 341 transitions. [2022-07-21 09:41:35,105 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 341 transitions. Word has length 166 [2022-07-21 09:41:35,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:35,106 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 341 transitions. [2022-07-21 09:41:35,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 7 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-21 09:41:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 341 transitions. [2022-07-21 09:41:35,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-21 09:41:35,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:35,108 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:41:35,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 09:41:35,108 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:35,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:35,109 INFO L85 PathProgramCache]: Analyzing trace with hash -119434237, now seen corresponding path program 1 times [2022-07-21 09:41:35,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:35,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528585321] [2022-07-21 09:41:35,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:35,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:41:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:41:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:41:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:41:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:41:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:41:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:41:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 09:41:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:41:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:41:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 09:41:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 09:41:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-07-21 09:41:35,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:35,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528585321] [2022-07-21 09:41:35,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528585321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:35,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:35,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:41:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604880572] [2022-07-21 09:41:35,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:35,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:41:35,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:35,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:41:35,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:41:35,415 INFO L87 Difference]: Start difference. First operand 261 states and 341 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 09:41:36,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:36,159 INFO L93 Difference]: Finished difference Result 395 states and 552 transitions. [2022-07-21 09:41:36,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:41:36,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 161 [2022-07-21 09:41:36,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:36,162 INFO L225 Difference]: With dead ends: 395 [2022-07-21 09:41:36,162 INFO L226 Difference]: Without dead ends: 301 [2022-07-21 09:41:36,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:41:36,163 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 91 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:36,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 574 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 09:41:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-21 09:41:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 282. [2022-07-21 09:41:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 184 states have (on average 1.1141304347826086) internal successors, (205), 187 states have internal predecessors, (205), 73 states have call successors, (73), 24 states have call predecessors, (73), 24 states have return successors, (104), 70 states have call predecessors, (104), 72 states have call successors, (104) [2022-07-21 09:41:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 382 transitions. [2022-07-21 09:41:36,197 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 382 transitions. Word has length 161 [2022-07-21 09:41:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:36,198 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 382 transitions. [2022-07-21 09:41:36,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 09:41:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 382 transitions. [2022-07-21 09:41:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-21 09:41:36,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:36,200 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-21 09:41:36,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 09:41:36,200 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:36,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:36,200 INFO L85 PathProgramCache]: Analyzing trace with hash -895461355, now seen corresponding path program 1 times [2022-07-21 09:41:36,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:36,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419364952] [2022-07-21 09:41:36,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:36,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:41:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:41:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:41:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:41:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:41:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:41:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 09:41:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 09:41:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 09:41:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 09:41:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 09:41:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 09:41:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 09:41:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2022-07-21 09:41:36,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:36,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419364952] [2022-07-21 09:41:36,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419364952] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:41:36,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202742028] [2022-07-21 09:41:36,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:36,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:41:36,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:41:36,825 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-21 09:41:36,827 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-21 09:41:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:37,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 2829 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-21 09:41:37,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:41:37,565 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-21 09:41:38,408 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-21 09:41:38,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 09:41:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-21 09:41:38,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:41:38,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202742028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:38,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:41:38,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [17] total 31 [2022-07-21 09:41:38,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470225810] [2022-07-21 09:41:38,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:38,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 09:41:38,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:38,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 09:41:38,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2022-07-21 09:41:38,461 INFO L87 Difference]: Start difference. First operand 282 states and 382 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 6 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-07-21 09:41:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:39,142 INFO L93 Difference]: Finished difference Result 414 states and 551 transitions. [2022-07-21 09:41:39,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 09:41:39,143 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 6 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 156 [2022-07-21 09:41:39,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:39,144 INFO L225 Difference]: With dead ends: 414 [2022-07-21 09:41:39,144 INFO L226 Difference]: Without dead ends: 254 [2022-07-21 09:41:39,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 172 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2022-07-21 09:41:39,146 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 167 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 503 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:39,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 872 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 466 Invalid, 0 Unknown, 503 Unchecked, 0.6s Time] [2022-07-21 09:41:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-21 09:41:39,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2022-07-21 09:41:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 170 states have (on average 1.1058823529411765) internal successors, (188), 172 states have internal predecessors, (188), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (80), 56 states have call predecessors, (80), 57 states have call successors, (80) [2022-07-21 09:41:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 326 transitions. [2022-07-21 09:41:39,175 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 326 transitions. Word has length 156 [2022-07-21 09:41:39,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:39,175 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 326 transitions. [2022-07-21 09:41:39,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 6 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-07-21 09:41:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 326 transitions. [2022-07-21 09:41:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-21 09:41:39,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:39,177 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:41:39,208 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-21 09:41:39,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:41:39,391 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:39,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:39,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2124518673, now seen corresponding path program 1 times [2022-07-21 09:41:39,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:39,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496267901] [2022-07-21 09:41:39,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:39,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:41:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:41:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:41:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:41:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:41:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:41:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:41:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 09:41:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:41:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:41:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 09:41:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 09:41:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-07-21 09:41:39,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:39,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496267901] [2022-07-21 09:41:39,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496267901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:39,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:39,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-21 09:41:39,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286059826] [2022-07-21 09:41:39,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:39,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 09:41:39,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:39,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 09:41:39,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:41:39,793 INFO L87 Difference]: Start difference. First operand 252 states and 326 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (20), 3 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-21 09:41:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:41,296 INFO L93 Difference]: Finished difference Result 260 states and 334 transitions. [2022-07-21 09:41:41,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 09:41:41,297 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (20), 3 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 159 [2022-07-21 09:41:41,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:41,299 INFO L225 Difference]: With dead ends: 260 [2022-07-21 09:41:41,299 INFO L226 Difference]: Without dead ends: 258 [2022-07-21 09:41:41,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-21 09:41:41,300 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 75 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:41,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1132 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-21 09:41:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-21 09:41:41,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 251. [2022-07-21 09:41:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 170 states have (on average 1.1058823529411765) internal successors, (188), 172 states have internal predecessors, (188), 57 states have call successors, (57), 23 states have call predecessors, (57), 23 states have return successors, (79), 55 states have call predecessors, (79), 56 states have call successors, (79) [2022-07-21 09:41:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 324 transitions. [2022-07-21 09:41:41,329 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 324 transitions. Word has length 159 [2022-07-21 09:41:41,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:41,331 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 324 transitions. [2022-07-21 09:41:41,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (20), 3 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-21 09:41:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 324 transitions. [2022-07-21 09:41:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-21 09:41:41,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:41,332 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:41:41,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 09:41:41,333 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:41,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:41,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1713654364, now seen corresponding path program 1 times [2022-07-21 09:41:41,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:41,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632076296] [2022-07-21 09:41:41,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:41,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:41:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:41:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:41:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:41:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:41:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:41:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 09:41:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 09:41:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:41:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:41:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 09:41:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 09:41:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-07-21 09:41:41,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:41,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632076296] [2022-07-21 09:41:41,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632076296] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:41:41,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484405172] [2022-07-21 09:41:41,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:41,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:41:41,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:41:41,932 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-21 09:41:41,958 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-21 09:41:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:42,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 2939 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-21 09:41:42,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:41:42,963 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 09:41:42,963 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 26 treesize of output 30 [2022-07-21 09:41:42,970 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 15 treesize of output 11 [2022-07-21 09:41:43,020 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 09:41:43,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 30 treesize of output 34 [2022-07-21 09:41:43,026 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 15 treesize of output 11 [2022-07-21 09:41:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 178 proven. 90 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-21 09:41:43,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:41:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2022-07-21 09:41:44,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484405172] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:41:44,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:41:44,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 12] total 30 [2022-07-21 09:41:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414975367] [2022-07-21 09:41:44,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:41:44,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-21 09:41:44,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:44,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-21 09:41:44,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2022-07-21 09:41:44,096 INFO L87 Difference]: Start difference. First operand 251 states and 324 transitions. Second operand has 30 states, 27 states have (on average 5.296296296296297) internal successors, (143), 27 states have internal predecessors, (143), 12 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (39), 9 states have call predecessors, (39), 12 states have call successors, (39) [2022-07-21 09:41:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:47,292 INFO L93 Difference]: Finished difference Result 429 states and 572 transitions. [2022-07-21 09:41:47,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 09:41:47,293 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 5.296296296296297) internal successors, (143), 27 states have internal predecessors, (143), 12 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (39), 9 states have call predecessors, (39), 12 states have call successors, (39) Word has length 163 [2022-07-21 09:41:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:47,294 INFO L225 Difference]: With dead ends: 429 [2022-07-21 09:41:47,295 INFO L226 Difference]: Without dead ends: 255 [2022-07-21 09:41:47,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 327 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=325, Invalid=2327, Unknown=0, NotChecked=0, Total=2652 [2022-07-21 09:41:47,297 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 219 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 3072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 664 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:47,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1147 Invalid, 3072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2275 Invalid, 0 Unknown, 664 Unchecked, 2.4s Time] [2022-07-21 09:41:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-21 09:41:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 192. [2022-07-21 09:41:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 133 states have (on average 1.105263157894737) internal successors, (147), 137 states have internal predecessors, (147), 40 states have call successors, (40), 16 states have call predecessors, (40), 18 states have return successors, (52), 38 states have call predecessors, (52), 39 states have call successors, (52) [2022-07-21 09:41:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 239 transitions. [2022-07-21 09:41:47,317 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 239 transitions. Word has length 163 [2022-07-21 09:41:47,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:47,318 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 239 transitions. [2022-07-21 09:41:47,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 5.296296296296297) internal successors, (143), 27 states have internal predecessors, (143), 12 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (39), 9 states have call predecessors, (39), 12 states have call successors, (39) [2022-07-21 09:41:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 239 transitions. [2022-07-21 09:41:47,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-21 09:41:47,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:47,319 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 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] [2022-07-21 09:41:47,349 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-21 09:41:47,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:41:47,543 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:47,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:47,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2076699861, now seen corresponding path program 1 times [2022-07-21 09:41:47,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:47,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609817865] [2022-07-21 09:41:47,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:47,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:41:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:41:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:41:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:41:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:41:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:41:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:41:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:41:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:41:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:41:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 09:41:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2022-07-21 09:41:47,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:47,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609817865] [2022-07-21 09:41:47,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609817865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:47,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:47,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:41:47,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102171758] [2022-07-21 09:41:47,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:47,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:41:47,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:47,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:41:47,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:41:47,994 INFO L87 Difference]: Start difference. First operand 192 states and 239 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-21 09:41:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:48,476 INFO L93 Difference]: Finished difference Result 283 states and 360 transitions. [2022-07-21 09:41:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:41:48,476 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 169 [2022-07-21 09:41:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:48,478 INFO L225 Difference]: With dead ends: 283 [2022-07-21 09:41:48,478 INFO L226 Difference]: Without dead ends: 186 [2022-07-21 09:41:48,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:41:48,479 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 84 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:48,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 412 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 09:41:48,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-21 09:41:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2022-07-21 09:41:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 125 states have (on average 1.104) internal successors, (138), 127 states have internal predecessors, (138), 38 states have call successors, (38), 16 states have call predecessors, (38), 17 states have return successors, (43), 37 states have call predecessors, (43), 37 states have call successors, (43) [2022-07-21 09:41:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 219 transitions. [2022-07-21 09:41:48,499 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 219 transitions. Word has length 169 [2022-07-21 09:41:48,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:48,500 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 219 transitions. [2022-07-21 09:41:48,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-21 09:41:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 219 transitions. [2022-07-21 09:41:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-21 09:41:48,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:48,501 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:41:48,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 09:41:48,501 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:48,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:48,502 INFO L85 PathProgramCache]: Analyzing trace with hash 248305514, now seen corresponding path program 1 times [2022-07-21 09:41:48,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:48,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391415650] [2022-07-21 09:41:48,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:48,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:41:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:41:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:41:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:41:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:41:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:41:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:41:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:41:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:41:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:41:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 09:41:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 09:41:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 09:41:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2022-07-21 09:41:48,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:48,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391415650] [2022-07-21 09:41:48,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391415650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:48,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:48,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:41:48,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712627944] [2022-07-21 09:41:48,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:48,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:41:48,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:48,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:41:48,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:41:48,752 INFO L87 Difference]: Start difference. First operand 181 states and 219 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 09:41:49,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:49,195 INFO L93 Difference]: Finished difference Result 260 states and 321 transitions. [2022-07-21 09:41:49,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:41:49,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 174 [2022-07-21 09:41:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:49,197 INFO L225 Difference]: With dead ends: 260 [2022-07-21 09:41:49,197 INFO L226 Difference]: Without dead ends: 178 [2022-07-21 09:41:49,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:41:49,198 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 51 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:49,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 440 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 09:41:49,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-21 09:41:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-07-21 09:41:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 123 states have (on average 1.0975609756097562) internal successors, (135), 124 states have internal predecessors, (135), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (42), 37 states have call predecessors, (42), 37 states have call successors, (42) [2022-07-21 09:41:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 215 transitions. [2022-07-21 09:41:49,217 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 215 transitions. Word has length 174 [2022-07-21 09:41:49,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:49,218 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 215 transitions. [2022-07-21 09:41:49,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 09:41:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 215 transitions. [2022-07-21 09:41:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-21 09:41:49,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:49,219 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-21 09:41:49,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-21 09:41:49,220 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:49,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:49,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1702864719, now seen corresponding path program 1 times [2022-07-21 09:41:49,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:49,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887977857] [2022-07-21 09:41:49,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:49,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:41:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:41:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:41:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:41:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:41:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:41:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:41:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:41:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:41:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:41:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 09:41:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 09:41:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 09:41:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2022-07-21 09:41:49,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:49,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887977857] [2022-07-21 09:41:49,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887977857] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:49,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:49,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 09:41:49,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096493632] [2022-07-21 09:41:49,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:49,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:41:49,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:49,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:41:49,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:41:49,571 INFO L87 Difference]: Start difference. First operand 178 states and 215 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (22), 3 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-21 09:41:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:50,210 INFO L93 Difference]: Finished difference Result 186 states and 223 transitions. [2022-07-21 09:41:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:41:50,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (22), 3 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 176 [2022-07-21 09:41:50,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:50,212 INFO L225 Difference]: With dead ends: 186 [2022-07-21 09:41:50,212 INFO L226 Difference]: Without dead ends: 184 [2022-07-21 09:41:50,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:41:50,213 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 52 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:50,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 733 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 09:41:50,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-21 09:41:50,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2022-07-21 09:41:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 126 states have (on average 1.0952380952380953) internal successors, (138), 127 states have internal predecessors, (138), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (43), 38 states have call predecessors, (43), 38 states have call successors, (43) [2022-07-21 09:41:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 220 transitions. [2022-07-21 09:41:50,233 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 220 transitions. Word has length 176 [2022-07-21 09:41:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:50,234 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 220 transitions. [2022-07-21 09:41:50,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (22), 3 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-21 09:41:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 220 transitions. [2022-07-21 09:41:50,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-21 09:41:50,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:50,235 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:41:50,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-21 09:41:50,236 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:50,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2119653097, now seen corresponding path program 1 times [2022-07-21 09:41:50,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:50,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24580533] [2022-07-21 09:41:50,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:50,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:41:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:41:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:41:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:41:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:41:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:41:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:41:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:41:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:41:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:41:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 09:41:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 09:41:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 09:41:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2022-07-21 09:41:50,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:50,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24580533] [2022-07-21 09:41:50,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24580533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:50,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:50,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-21 09:41:50,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834048122] [2022-07-21 09:41:50,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:50,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 09:41:50,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:50,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 09:41:50,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-07-21 09:41:50,868 INFO L87 Difference]: Start difference. First operand 183 states and 220 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 20 states have internal predecessors, (62), 11 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-21 09:41:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:52,893 INFO L93 Difference]: Finished difference Result 258 states and 317 transitions. [2022-07-21 09:41:52,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 09:41:52,894 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 20 states have internal predecessors, (62), 11 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) Word has length 180 [2022-07-21 09:41:52,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:52,895 INFO L225 Difference]: With dead ends: 258 [2022-07-21 09:41:52,895 INFO L226 Difference]: Without dead ends: 182 [2022-07-21 09:41:52,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2022-07-21 09:41:52,896 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 153 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:52,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 929 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 09:41:52,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-21 09:41:52,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-07-21 09:41:52,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 126 states have (on average 1.0952380952380953) internal successors, (138), 127 states have internal predecessors, (138), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (41), 37 states have call predecessors, (41), 37 states have call successors, (41) [2022-07-21 09:41:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 217 transitions. [2022-07-21 09:41:52,915 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 217 transitions. Word has length 180 [2022-07-21 09:41:52,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:52,915 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 217 transitions. [2022-07-21 09:41:52,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 20 states have internal predecessors, (62), 11 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-21 09:41:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 217 transitions. [2022-07-21 09:41:52,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-21 09:41:52,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:52,917 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-21 09:41:52,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-21 09:41:52,917 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:52,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:52,918 INFO L85 PathProgramCache]: Analyzing trace with hash 262901839, now seen corresponding path program 1 times [2022-07-21 09:41:52,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:52,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011105308] [2022-07-21 09:41:52,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:52,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:41:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:41:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:41:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:41:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:41:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:41:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:41:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:41:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:41:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:41:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 09:41:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 09:41:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 09:41:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 09:41:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 09:41:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2022-07-21 09:41:53,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:53,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011105308] [2022-07-21 09:41:53,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011105308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:53,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:53,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 09:41:53,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849780585] [2022-07-21 09:41:53,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:53,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:41:53,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:53,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:41:53,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:41:53,338 INFO L87 Difference]: Start difference. First operand 182 states and 217 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (24), 3 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-21 09:41:53,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:53,881 INFO L93 Difference]: Finished difference Result 190 states and 225 transitions. [2022-07-21 09:41:53,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:41:53,882 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (24), 3 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 192 [2022-07-21 09:41:53,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:53,883 INFO L225 Difference]: With dead ends: 190 [2022-07-21 09:41:53,883 INFO L226 Difference]: Without dead ends: 188 [2022-07-21 09:41:53,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:41:53,884 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 52 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:53,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 733 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 09:41:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-21 09:41:53,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2022-07-21 09:41:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 129 states have (on average 1.0930232558139534) internal successors, (141), 130 states have internal predecessors, (141), 39 states have call successors, (39), 18 states have call predecessors, (39), 18 states have return successors, (42), 38 states have call predecessors, (42), 38 states have call successors, (42) [2022-07-21 09:41:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 222 transitions. [2022-07-21 09:41:53,904 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 222 transitions. Word has length 192 [2022-07-21 09:41:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:53,905 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 222 transitions. [2022-07-21 09:41:53,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (24), 3 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-21 09:41:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 222 transitions. [2022-07-21 09:41:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-21 09:41:53,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:53,906 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 7, 7, 7, 7, 7, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:41:53,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-21 09:41:53,907 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:53,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:53,907 INFO L85 PathProgramCache]: Analyzing trace with hash 547574295, now seen corresponding path program 1 times [2022-07-21 09:41:53,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:53,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222314774] [2022-07-21 09:41:53,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:53,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:41:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:41:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:41:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:41:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:41:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:41:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:41:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:41:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:41:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:41:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 09:41:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 09:41:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 09:41:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 09:41:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 09:41:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2022-07-21 09:41:54,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:54,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222314774] [2022-07-21 09:41:54,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222314774] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:54,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:54,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-21 09:41:54,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531560323] [2022-07-21 09:41:54,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:54,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 09:41:54,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:54,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 09:41:54,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-21 09:41:54,559 INFO L87 Difference]: Start difference. First operand 187 states and 222 transitions. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 14 states have internal predecessors, (65), 8 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-07-21 09:41:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:55,894 INFO L93 Difference]: Finished difference Result 247 states and 294 transitions. [2022-07-21 09:41:55,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 09:41:55,894 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 14 states have internal predecessors, (65), 8 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 196 [2022-07-21 09:41:55,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:55,896 INFO L225 Difference]: With dead ends: 247 [2022-07-21 09:41:55,896 INFO L226 Difference]: Without dead ends: 188 [2022-07-21 09:41:55,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2022-07-21 09:41:55,897 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 152 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:55,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 747 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-21 09:41:55,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-21 09:41:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2022-07-21 09:41:55,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 129 states have (on average 1.0930232558139534) internal successors, (141), 130 states have internal predecessors, (141), 38 states have call successors, (38), 18 states have call predecessors, (38), 18 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-07-21 09:41:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 219 transitions. [2022-07-21 09:41:55,916 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 219 transitions. Word has length 196 [2022-07-21 09:41:55,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:55,916 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 219 transitions. [2022-07-21 09:41:55,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 14 states have internal predecessors, (65), 8 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-07-21 09:41:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 219 transitions. [2022-07-21 09:41:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-21 09:41:55,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:55,918 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2022-07-21 09:41:55,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-21 09:41:55,919 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:55,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:55,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1941778844, now seen corresponding path program 1 times [2022-07-21 09:41:55,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:55,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524589416] [2022-07-21 09:41:55,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:55,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:41:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:41:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:41:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:41:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:41:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:41:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:41:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:41:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:41:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:41:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 09:41:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 09:41:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 09:41:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 09:41:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 09:41:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 09:41:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2022-07-21 09:41:56,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:56,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524589416] [2022-07-21 09:41:56,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524589416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:56,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:56,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 09:41:56,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331135448] [2022-07-21 09:41:56,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:56,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 09:41:56,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:56,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 09:41:56,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:41:56,309 INFO L87 Difference]: Start difference. First operand 186 states and 219 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (25), 4 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-21 09:41:57,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:57,285 INFO L93 Difference]: Finished difference Result 198 states and 233 transitions. [2022-07-21 09:41:57,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 09:41:57,285 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (25), 4 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) Word has length 199 [2022-07-21 09:41:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:57,287 INFO L225 Difference]: With dead ends: 198 [2022-07-21 09:41:57,287 INFO L226 Difference]: Without dead ends: 196 [2022-07-21 09:41:57,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-07-21 09:41:57,287 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 96 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:57,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 685 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 09:41:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-21 09:41:57,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 191. [2022-07-21 09:41:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 132 states have (on average 1.0909090909090908) internal successors, (144), 133 states have internal predecessors, (144), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (41), 38 states have call predecessors, (41), 38 states have call successors, (41) [2022-07-21 09:41:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 224 transitions. [2022-07-21 09:41:57,307 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 224 transitions. Word has length 199 [2022-07-21 09:41:57,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:57,308 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 224 transitions. [2022-07-21 09:41:57,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (25), 4 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-21 09:41:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 224 transitions. [2022-07-21 09:41:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-21 09:41:57,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:57,310 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 7, 7, 7, 7, 7, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:41:57,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-21 09:41:57,310 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:57,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:57,310 INFO L85 PathProgramCache]: Analyzing trace with hash -574364444, now seen corresponding path program 1 times [2022-07-21 09:41:57,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:57,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063234471] [2022-07-21 09:41:57,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:57,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:41:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:41:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:41:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:41:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:41:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:41:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:41:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:41:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:41:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:41:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 09:41:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 09:41:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 09:41:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 09:41:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 09:41:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 09:41:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2022-07-21 09:41:57,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:57,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063234471] [2022-07-21 09:41:57,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063234471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:57,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:57,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:41:57,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067396502] [2022-07-21 09:41:57,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:57,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:41:57,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:57,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:41:57,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:41:57,708 INFO L87 Difference]: Start difference. First operand 191 states and 224 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-21 09:41:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:58,501 INFO L93 Difference]: Finished difference Result 266 states and 318 transitions. [2022-07-21 09:41:58,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 09:41:58,502 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 203 [2022-07-21 09:41:58,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:58,503 INFO L225 Difference]: With dead ends: 266 [2022-07-21 09:41:58,503 INFO L226 Difference]: Without dead ends: 192 [2022-07-21 09:41:58,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-07-21 09:41:58,504 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 109 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:58,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 484 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 09:41:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-21 09:41:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-07-21 09:41:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 133 states have (on average 1.0902255639097744) internal successors, (145), 134 states have internal predecessors, (145), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (41), 38 states have call predecessors, (41), 38 states have call successors, (41) [2022-07-21 09:41:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 225 transitions. [2022-07-21 09:41:58,519 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 225 transitions. Word has length 203 [2022-07-21 09:41:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:58,520 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 225 transitions. [2022-07-21 09:41:58,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-21 09:41:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 225 transitions. [2022-07-21 09:41:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-07-21 09:41:58,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:58,521 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 7, 7, 7, 7, 7, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:41:58,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-21 09:41:58,521 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:58,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:58,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1436566363, now seen corresponding path program 1 times [2022-07-21 09:41:58,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:58,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175533583] [2022-07-21 09:41:58,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:58,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:41:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:41:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:41:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:41:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:41:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:41:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:41:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:41:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:41:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:41:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 09:41:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 09:41:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 09:41:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 09:41:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 09:41:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 09:41:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2022-07-21 09:41:58,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:58,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175533583] [2022-07-21 09:41:58,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175533583] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:41:58,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127031709] [2022-07-21 09:41:58,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:58,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:41:58,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:41:58,930 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-21 09:41:58,931 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-21 09:41:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 3205 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 09:41:59,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:41:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 62 proven. 1 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-07-21 09:41:59,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:41:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2022-07-21 09:41:59,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127031709] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 09:41:59,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:41:59,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9, 5] total 10 [2022-07-21 09:41:59,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150576179] [2022-07-21 09:41:59,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:59,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:41:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:59,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:41:59,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:41:59,673 INFO L87 Difference]: Start difference. First operand 192 states and 225 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 09:41:59,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:59,846 INFO L93 Difference]: Finished difference Result 263 states and 313 transitions. [2022-07-21 09:41:59,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 09:41:59,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 204 [2022-07-21 09:41:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:59,848 INFO L225 Difference]: With dead ends: 263 [2022-07-21 09:41:59,848 INFO L226 Difference]: Without dead ends: 193 [2022-07-21 09:41:59,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 450 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:41:59,849 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 4 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:59,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 466 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:41:59,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-21 09:41:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2022-07-21 09:41:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 134 states have (on average 1.0895522388059702) internal successors, (146), 135 states have internal predecessors, (146), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (41), 38 states have call predecessors, (41), 38 states have call successors, (41) [2022-07-21 09:41:59,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2022-07-21 09:41:59,869 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 204 [2022-07-21 09:41:59,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:59,870 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2022-07-21 09:41:59,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 09:41:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2022-07-21 09:41:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-07-21 09:41:59,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:59,871 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 7, 7, 7, 7, 7, 5, 5, 5, 5, 4, 4, 4, 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, 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-21 09:41:59,900 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-21 09:42:00,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:42:00,095 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:42:00,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:42:00,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1330763706, now seen corresponding path program 1 times [2022-07-21 09:42:00,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:42:00,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278212268] [2022-07-21 09:42:00,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:42:00,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:42:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:42:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:42:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 09:42:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:42:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:42:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 09:42:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:42:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:42:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:42:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:42:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:42:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:42:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:42:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:42:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:42:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:42:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:42:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:42:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 09:42:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 09:42:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 09:42:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 09:42:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 09:42:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 09:42:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 56 proven. 5 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2022-07-21 09:42:00,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:42:00,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278212268] [2022-07-21 09:42:00,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278212268] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:42:00,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350046850] [2022-07-21 09:42:00,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:42:00,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:42:00,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:42:00,984 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-21 09:42:01,012 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-21 09:42:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:01,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 3228 conjuncts, 143 conjunts are in the unsatisfiable core [2022-07-21 09:42:01,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:42:08,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:42:08,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:42:08,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 09:42:08,058 INFO L356 Elim1Store]: treesize reduction 30, result has 41.2 percent of original size [2022-07-21 09:42:08,058 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2022-07-21 09:42:08,074 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-21 09:42:08,075 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 2 case distinctions, treesize of input 36 treesize of output 46 [2022-07-21 09:42:08,084 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-21 09:42:08,092 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-21 09:42:08,103 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 90 [2022-07-21 09:42:08,130 INFO L356 Elim1Store]: treesize reduction 40, result has 38.5 percent of original size [2022-07-21 09:42:08,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 152 [2022-07-21 09:42:08,140 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 25 treesize of output 24 [2022-07-21 09:42:08,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:42:08,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2022-07-21 09:42:08,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:42:08,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2022-07-21 09:42:08,186 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 09:42:08,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:42:08,224 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 0 case distinctions, treesize of input 46 treesize of output 19 [2022-07-21 09:42:08,228 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 13 treesize of output 9 [2022-07-21 09:42:08,272 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-21 09:42:08,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-21 09:42:08,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-21 09:42:08,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-21 09:42:08,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-21 09:42:08,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-21 09:42:08,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-21 09:42:08,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:42:08,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-21 09:42:09,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:42:09,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-21 09:42:09,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:42:09,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-21 09:42:11,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:42:11,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-21 09:42:11,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:42:11,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-21 09:42:13,919 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3449 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3449) |c_#memory_int|)) (exists ((v_ArrVal_3436 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3436))) (exists ((v_ArrVal_3448 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3448) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-21 09:42:13,930 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3454 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3454))) (exists ((v_ArrVal_3452 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3452) |c_#memory_int|)) (exists ((v_ArrVal_3453 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3453) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 09:42:13,982 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-21 09:42:13,982 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 52 treesize of output 69 [2022-07-21 09:42:13,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:42:14,003 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-21 09:42:14,003 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 66 treesize of output 71 [2022-07-21 09:42:14,008 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 09:42:14,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-21 09:42:14,208 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,SelfDestructingSolverStorable33 [2022-07-21 09:42:14,209 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 09:42:14,214 INFO L158 Benchmark]: Toolchain (without parser) took 153897.95ms. Allocated memory was 54.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 33.6MB in the beginning and 526.1MB in the end (delta: -492.5MB). Peak memory consumption was 649.8MB. Max. memory is 16.1GB. [2022-07-21 09:42:14,214 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory was 36.0MB in the beginning and 35.9MB in the end (delta: 45.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 09:42:14,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2025.11ms. Allocated memory was 54.5MB in the beginning and 100.7MB in the end (delta: 46.1MB). Free memory was 33.4MB in the beginning and 45.7MB in the end (delta: -12.3MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2022-07-21 09:42:14,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 242.98ms. Allocated memory is still 100.7MB. Free memory was 45.7MB in the beginning and 50.9MB in the end (delta: -5.2MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2022-07-21 09:42:14,216 INFO L158 Benchmark]: Boogie Preprocessor took 149.36ms. Allocated memory is still 100.7MB. Free memory was 50.9MB in the beginning and 45.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-21 09:42:14,216 INFO L158 Benchmark]: RCFGBuilder took 1396.08ms. Allocated memory was 100.7MB in the beginning and 134.2MB in the end (delta: 33.6MB). Free memory was 45.3MB in the beginning and 83.7MB in the end (delta: -38.3MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2022-07-21 09:42:14,217 INFO L158 Benchmark]: TraceAbstraction took 150076.78ms. Allocated memory was 134.2MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 82.7MB in the beginning and 526.1MB in the end (delta: -443.3MB). Peak memory consumption was 619.7MB. Max. memory is 16.1GB. [2022-07-21 09:42:14,218 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory was 36.0MB in the beginning and 35.9MB in the end (delta: 45.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2025.11ms. Allocated memory was 54.5MB in the beginning and 100.7MB in the end (delta: 46.1MB). Free memory was 33.4MB in the beginning and 45.7MB in the end (delta: -12.3MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 242.98ms. Allocated memory is still 100.7MB. Free memory was 45.7MB in the beginning and 50.9MB in the end (delta: -5.2MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 149.36ms. Allocated memory is still 100.7MB. Free memory was 50.9MB in the beginning and 45.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1396.08ms. Allocated memory was 100.7MB in the beginning and 134.2MB in the end (delta: 33.6MB). Free memory was 45.3MB in the beginning and 83.7MB in the end (delta: -38.3MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * TraceAbstraction took 150076.78ms. Allocated memory was 134.2MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 82.7MB in the beginning and 526.1MB in the end (delta: -443.3MB). Peak memory consumption was 619.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 09:42:14,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_read_u8_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 f1ac591932d47e9b0b8902b9705db38e4b5e721c8f02110220ca6714b79582bb --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 09:42:16,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:42:16,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:42:16,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:42:16,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:42:16,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:42:16,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:42:16,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:42:16,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:42:16,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:42:16,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:42:16,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:42:16,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:42:16,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:42:16,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:42:16,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:42:16,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:42:16,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:42:16,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:42:16,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:42:16,276 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:42:16,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:42:16,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:42:16,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:42:16,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:42:16,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:42:16,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:42:16,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:42:16,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:42:16,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:42:16,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:42:16,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:42:16,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:42:16,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:42:16,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:42:16,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:42:16,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:42:16,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:42:16,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:42:16,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:42:16,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:42:16,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:42:16,306 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-21 09:42:16,338 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:42:16,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:42:16,339 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:42:16,339 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:42:16,340 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:42:16,340 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:42:16,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:42:16,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:42:16,341 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:42:16,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:42:16,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:42:16,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:42:16,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:42:16,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:42:16,344 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 09:42:16,344 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 09:42:16,344 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 09:42:16,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:42:16,345 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:42:16,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:42:16,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:42:16,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:42:16,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:42:16,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:42:16,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:42:16,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:42:16,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:42:16,347 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 09:42:16,347 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 09:42:16,347 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:42:16,348 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:42:16,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:42:16,348 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 09:42:16,348 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> f1ac591932d47e9b0b8902b9705db38e4b5e721c8f02110220ca6714b79582bb [2022-07-21 09:42:16,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:42:16,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:42:16,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:42:16,708 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:42:16,708 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:42:16,710 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_read_u8_harness.i [2022-07-21 09:42:16,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1bc33232/d1abd9f3436b4d74b8cdf0d1e5b91f8d/FLAGb4519c7b1 [2022-07-21 09:42:17,509 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:42:17,510 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_read_u8_harness.i [2022-07-21 09:42:17,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1bc33232/d1abd9f3436b4d74b8cdf0d1e5b91f8d/FLAGb4519c7b1 [2022-07-21 09:42:17,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1bc33232/d1abd9f3436b4d74b8cdf0d1e5b91f8d [2022-07-21 09:42:17,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:42:17,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:42:17,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:42:17,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:42:17,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:42:17,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:42:17" (1/1) ... [2022-07-21 09:42:17,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f25157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:42:17, skipping insertion in model container [2022-07-21 09:42:17,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:42:17" (1/1) ... [2022-07-21 09:42:17,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:42:17,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:42:17,919 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_read_u8_harness.i[4497,4510] [2022-07-21 09:42:17,927 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_read_u8_harness.i[4557,4570] [2022-07-21 09:42:19,122 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:42:19,123 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:42:19,124 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:42:19,126 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:42:19,127 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:42:19,146 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:42:19,147 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:42:19,148 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:42:19,148 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:42:19,468 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-21 09:42:19,469 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-21 09:42:19,470 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-21 09:42:19,471 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-21 09:42:19,472 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-21 09:42:19,472 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-21 09:42:19,473 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-21 09:42:19,473 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-21 09:42:19,474 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-21 09:42:19,474 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-21 09:42:19,582 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-21 09:42:19,595 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of int range at java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1009) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1384) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:249) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.translateInitializer(CHandler.java:2978) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleIASTDeclarator(CHandler.java:2836) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2138) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:143) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:211) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 09:42:19,600 INFO L158 Benchmark]: Toolchain (without parser) took 1973.60ms. Allocated memory was 52.4MB in the beginning and 73.4MB in the end (delta: 21.0MB). Free memory was 30.7MB in the beginning and 41.7MB in the end (delta: -11.0MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2022-07-21 09:42:19,601 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 52.4MB. Free memory was 33.7MB in the beginning and 33.6MB in the end (delta: 45.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 09:42:19,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1972.06ms. Allocated memory was 52.4MB in the beginning and 73.4MB in the end (delta: 21.0MB). Free memory was 30.4MB in the beginning and 41.7MB in the end (delta: -11.3MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2022-07-21 09:42:19,604 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 52.4MB. Free memory was 33.7MB in the beginning and 33.6MB in the end (delta: 45.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1972.06ms. Allocated memory was 52.4MB in the beginning and 73.4MB in the end (delta: 21.0MB). Free memory was 30.4MB in the beginning and 41.7MB in the end (delta: -11.3MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of int range: java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range