./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 60926facf5511174d61dcd6a0b7a731efc9ccdb495bc26b58400da4cd6320ca0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:03:29,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:03:29,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:03:29,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:03:29,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:03:29,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:03:29,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:03:29,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:03:29,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:03:29,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:03:29,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:03:29,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:03:29,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:03:29,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:03:29,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:03:29,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:03:29,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:03:29,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:03:29,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:03:29,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:03:29,510 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:03:29,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:03:29,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:03:29,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:03:29,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:03:29,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:03:29,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:03:29,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:03:29,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:03:29,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:03:29,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:03:29,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:03:29,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:03:29,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:03:29,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:03:29,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:03:29,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:03:29,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:03:29,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:03:29,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:03:29,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:03:29,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:03:29,523 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:03:29,545 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:03:29,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:03:29,546 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:03:29,546 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:03:29,547 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:03:29,547 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:03:29,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:03:29,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:03:29,548 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:03:29,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:03:29,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:03:29,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:03:29,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:03:29,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:03:29,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:03:29,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:03:29,550 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:03:29,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:03:29,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:03:29,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:03:29,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:03:29,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:03:29,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:03:29,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:03:29,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:03:29,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:03:29,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:03:29,552 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:03:29,552 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:03:29,552 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:03:29,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60926facf5511174d61dcd6a0b7a731efc9ccdb495bc26b58400da4cd6320ca0 [2022-07-19 22:03:29,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:03:29,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:03:29,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:03:29,783 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:03:29,784 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:03:29,785 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i [2022-07-19 22:03:29,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a6d6191/2fcfbc769177421ea511a0b33367e663/FLAG313feb69e [2022-07-19 22:03:30,363 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:03:30,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i [2022-07-19 22:03:30,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a6d6191/2fcfbc769177421ea511a0b33367e663/FLAG313feb69e [2022-07-19 22:03:30,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a6d6191/2fcfbc769177421ea511a0b33367e663 [2022-07-19 22:03:30,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:03:30,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:03:30,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:03:30,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:03:30,575 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:03:30,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:03:30" (1/1) ... [2022-07-19 22:03:30,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5750bd07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:30, skipping insertion in model container [2022-07-19 22:03:30,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:03:30" (1/1) ... [2022-07-19 22:03:30,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:03:30,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:03:30,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i[4505,4518] [2022-07-19 22:03:30,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i[4565,4578] [2022-07-19 22:03:31,344 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,347 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,350 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,351 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,353 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,376 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,376 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,378 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,382 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,583 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:03:31,584 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:03:31,585 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:03:31,586 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:03:31,586 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:03:31,587 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:03:31,587 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:03:31,588 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:03:31,588 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:03:31,588 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:03:31,709 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:03:31,800 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,801 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:03:31,916 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:03:31,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i[4505,4518] [2022-07-19 22:03:31,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i[4565,4578] [2022-07-19 22:03:31,965 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,965 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,966 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,966 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,966 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,971 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,973 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,974 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:31,974 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:32,015 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:03:32,015 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:03:32,016 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:03:32,016 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:03:32,017 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:03:32,017 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:03:32,017 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:03:32,018 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:03:32,018 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:03:32,018 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:03:32,038 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:03:32,082 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:32,082 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:32,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:03:32,253 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:03:32,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:32 WrapperNode [2022-07-19 22:03:32,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:03:32,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:03:32,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:03:32,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:03:32,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:32" (1/1) ... [2022-07-19 22:03:32,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:32" (1/1) ... [2022-07-19 22:03:32,408 INFO L137 Inliner]: procedures = 691, calls = 2656, calls flagged for inlining = 59, calls inlined = 6, statements flattened = 925 [2022-07-19 22:03:32,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:03:32,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:03:32,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:03:32,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:03:32,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:32" (1/1) ... [2022-07-19 22:03:32,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:32" (1/1) ... [2022-07-19 22:03:32,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:32" (1/1) ... [2022-07-19 22:03:32,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:32" (1/1) ... [2022-07-19 22:03:32,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:32" (1/1) ... [2022-07-19 22:03:32,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:32" (1/1) ... [2022-07-19 22:03:32,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:32" (1/1) ... [2022-07-19 22:03:32,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:03:32,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:03:32,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:03:32,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:03:32,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:32" (1/1) ... [2022-07-19 22:03:32,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:03:32,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:32,532 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-19 22:03:32,550 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-19 22:03:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-19 22:03:32,563 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-19 22:03:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_compare_lexical [2022-07-19 22:03:32,564 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_compare_lexical [2022-07-19 22:03:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-19 22:03:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:03:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-19 22:03:32,565 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-19 22:03:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:03:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_bounded [2022-07-19 22:03:32,566 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_bounded [2022-07-19 22:03:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 22:03:32,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 22:03:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:03:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:03:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2022-07-19 22:03:32,567 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2022-07-19 22:03:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:03:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:03:32,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:03:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 22:03:32,567 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 22:03:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-19 22:03:32,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-19 22:03:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 22:03:32,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 22:03:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:03:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:03:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:03:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-19 22:03:32,570 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-19 22:03:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 22:03:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-19 22:03:32,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-19 22:03:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:03:32,854 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:03:32,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:03:33,662 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:03:33,669 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:03:33,669 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 22:03:33,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:03:33 BoogieIcfgContainer [2022-07-19 22:03:33,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:03:33,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:03:33,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:03:33,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:03:33,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:03:30" (1/3) ... [2022-07-19 22:03:33,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9fd268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:03:33, skipping insertion in model container [2022-07-19 22:03:33,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:32" (2/3) ... [2022-07-19 22:03:33,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9fd268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:03:33, skipping insertion in model container [2022-07-19 22:03:33,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:03:33" (3/3) ... [2022-07-19 22:03:33,678 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_compare_lexical_harness.i [2022-07-19 22:03:33,691 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:03:33,691 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:03:33,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:03:33,754 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@2ab66708, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2f8f551e [2022-07-19 22:03:33,754 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:03:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 93 states have internal predecessors, (113), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-19 22:03:33,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 22:03:33,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:33,772 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:33,772 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:33,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:33,777 INFO L85 PathProgramCache]: Analyzing trace with hash 616113637, now seen corresponding path program 1 times [2022-07-19 22:03:33,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:33,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44705824] [2022-07-19 22:03:33,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:33,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:03:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:03:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:03:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:03:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:03:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:03:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:03:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 22:03:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:03:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:03:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 22:03:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 22:03:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:03:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 22:03:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 22:03:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 22:03:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 22:03:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 22:03:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-19 22:03:34,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:34,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44705824] [2022-07-19 22:03:34,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44705824] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:34,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433682695] [2022-07-19 22:03:34,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:34,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:34,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:34,616 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-19 22:03:34,617 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-19 22:03:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:35,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 2699 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 22:03:35,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:03:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-19 22:03:35,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:03:35,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433682695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:03:35,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:03:35,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-19 22:03:35,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898773580] [2022-07-19 22:03:35,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:03:35,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:03:35,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:35,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:03:35,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:03:35,193 INFO L87 Difference]: Start difference. First operand has 151 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 93 states have internal predecessors, (113), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-19 22:03:35,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:35,389 INFO L93 Difference]: Finished difference Result 301 states and 447 transitions. [2022-07-19 22:03:35,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:03:35,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 120 [2022-07-19 22:03:35,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:35,399 INFO L225 Difference]: With dead ends: 301 [2022-07-19 22:03:35,399 INFO L226 Difference]: Without dead ends: 148 [2022-07-19 22:03:35,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:03:35,405 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 222 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:35,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 422 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:03:35,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-19 22:03:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-07-19 22:03:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 89 states have (on average 1.202247191011236) internal successors, (107), 91 states have internal predecessors, (107), 46 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (51), 45 states have call predecessors, (51), 45 states have call successors, (51) [2022-07-19 22:03:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 204 transitions. [2022-07-19 22:03:35,446 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 204 transitions. Word has length 120 [2022-07-19 22:03:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:35,446 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 204 transitions. [2022-07-19 22:03:35,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-19 22:03:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 204 transitions. [2022-07-19 22:03:35,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-19 22:03:35,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:35,449 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:35,482 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-19 22:03:35,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-19 22:03:35,670 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:35,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:35,671 INFO L85 PathProgramCache]: Analyzing trace with hash 138900842, now seen corresponding path program 1 times [2022-07-19 22:03:35,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:35,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574247987] [2022-07-19 22:03:35,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:35,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:35,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:35,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:03:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:35,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:03:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:35,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:03:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:35,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:03:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:35,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:03:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:03:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:03:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 22:03:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:03:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 22:03:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:03:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 22:03:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 22:03:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 22:03:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:03:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:03:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:03:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:03:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-07-19 22:03:36,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:36,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574247987] [2022-07-19 22:03:36,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574247987] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:36,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969417770] [2022-07-19 22:03:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:36,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:36,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:36,139 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-19 22:03:36,140 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-19 22:03:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 2704 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 22:03:36,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:03:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-19 22:03:36,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:03:36,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969417770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:03:36,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:03:36,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2022-07-19 22:03:36,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037676290] [2022-07-19 22:03:36,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:03:36,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:03:36,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:36,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:03:36,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-07-19 22:03:36,643 INFO L87 Difference]: Start difference. First operand 148 states and 204 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-19 22:03:36,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:36,943 INFO L93 Difference]: Finished difference Result 242 states and 337 transitions. [2022-07-19 22:03:36,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:03:36,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 122 [2022-07-19 22:03:36,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:36,946 INFO L225 Difference]: With dead ends: 242 [2022-07-19 22:03:36,946 INFO L226 Difference]: Without dead ends: 148 [2022-07-19 22:03:36,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-07-19 22:03:36,947 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 233 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:36,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 708 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:03:36,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-19 22:03:36,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-07-19 22:03:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 89 states have (on average 1.202247191011236) internal successors, (107), 91 states have internal predecessors, (107), 46 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2022-07-19 22:03:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 202 transitions. [2022-07-19 22:03:36,961 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 202 transitions. Word has length 122 [2022-07-19 22:03:36,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:36,963 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 202 transitions. [2022-07-19 22:03:36,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-19 22:03:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 202 transitions. [2022-07-19 22:03:36,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-19 22:03:36,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:36,970 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:36,991 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-19 22:03:37,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-07-19 22:03:37,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:37,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:37,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2034710092, now seen corresponding path program 2 times [2022-07-19 22:03:37,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:37,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163554503] [2022-07-19 22:03:37,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:37,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:03:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:03:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:03:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:03:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:03:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:03:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:03:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 22:03:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:03:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 22:03:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:03:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 22:03:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:03:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:03:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:03:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:03:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:03:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 22:03:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-07-19 22:03:37,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:37,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163554503] [2022-07-19 22:03:37,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163554503] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:37,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106539995] [2022-07-19 22:03:37,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 22:03:37,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:37,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:37,483 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-19 22:03:37,484 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-19 22:03:37,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 22:03:37,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:03:37,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 2312 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 22:03:37,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:03:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-07-19 22:03:37,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:03:37,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106539995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:03:37,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:03:37,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-19 22:03:37,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433206261] [2022-07-19 22:03:37,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:03:37,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:03:37,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:37,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:03:37,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:03:37,892 INFO L87 Difference]: Start difference. First operand 148 states and 202 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-19 22:03:37,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:37,959 INFO L93 Difference]: Finished difference Result 160 states and 221 transitions. [2022-07-19 22:03:37,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:03:37,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2022-07-19 22:03:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:37,961 INFO L225 Difference]: With dead ends: 160 [2022-07-19 22:03:37,961 INFO L226 Difference]: Without dead ends: 158 [2022-07-19 22:03:37,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:03:37,962 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 16 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:37,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1341 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:03:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-19 22:03:37,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2022-07-19 22:03:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 95 states have (on average 1.1894736842105262) internal successors, (113), 98 states have internal predecessors, (113), 47 states have call successors, (47), 12 states have call predecessors, (47), 14 states have return successors, (58), 46 states have call predecessors, (58), 46 states have call successors, (58) [2022-07-19 22:03:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 218 transitions. [2022-07-19 22:03:37,973 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 218 transitions. Word has length 126 [2022-07-19 22:03:37,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:37,974 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 218 transitions. [2022-07-19 22:03:37,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-19 22:03:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 218 transitions. [2022-07-19 22:03:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-19 22:03:37,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:37,975 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:37,999 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-19 22:03:38,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:38,198 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:38,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:38,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1275067964, now seen corresponding path program 1 times [2022-07-19 22:03:38,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:38,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049838052] [2022-07-19 22:03:38,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:38,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:03:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:03:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:03:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:03:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:03:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:03:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:03:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 22:03:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:03:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 22:03:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:03:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 22:03:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:03:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:03:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:03:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:03:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:03:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 22:03:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-07-19 22:03:38,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:38,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049838052] [2022-07-19 22:03:38,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049838052] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:38,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14776119] [2022-07-19 22:03:38,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:38,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:38,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:38,482 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-19 22:03:38,483 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-19 22:03:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:38,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 2726 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 22:03:38,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:03:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-19 22:03:38,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:03:38,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14776119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:03:38,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:03:38,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-19 22:03:38,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162232404] [2022-07-19 22:03:38,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:03:38,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:03:38,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:38,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:03:38,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:03:38,966 INFO L87 Difference]: Start difference. First operand 157 states and 218 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-19 22:03:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:39,331 INFO L93 Difference]: Finished difference Result 307 states and 437 transitions. [2022-07-19 22:03:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:03:39,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 130 [2022-07-19 22:03:39,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:39,334 INFO L225 Difference]: With dead ends: 307 [2022-07-19 22:03:39,334 INFO L226 Difference]: Without dead ends: 187 [2022-07-19 22:03:39,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-07-19 22:03:39,335 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 277 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:39,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 810 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 22:03:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-19 22:03:39,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-19 22:03:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 114 states have internal predecessors, (133), 60 states have call successors, (60), 13 states have call predecessors, (60), 15 states have return successors, (73), 59 states have call predecessors, (73), 59 states have call successors, (73) [2022-07-19 22:03:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 266 transitions. [2022-07-19 22:03:39,348 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 266 transitions. Word has length 130 [2022-07-19 22:03:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:39,363 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 266 transitions. [2022-07-19 22:03:39,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-19 22:03:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 266 transitions. [2022-07-19 22:03:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-19 22:03:39,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:39,365 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:39,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-19 22:03:39,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:39,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:39,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:39,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1527536575, now seen corresponding path program 1 times [2022-07-19 22:03:39,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:39,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605688304] [2022-07-19 22:03:39,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:39,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:39,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:39,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:03:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:39,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:03:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:03:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:03:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:03:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:03:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:03:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 22:03:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:03:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 22:03:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:03:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 22:03:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 22:03:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 22:03:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:03:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:03:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 22:03:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:03:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-19 22:03:40,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:40,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605688304] [2022-07-19 22:03:40,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605688304] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:40,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502020382] [2022-07-19 22:03:40,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:40,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:40,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:40,230 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-19 22:03:40,231 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-19 22:03:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:40,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 2731 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-19 22:03:40,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:03:40,721 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-19 22:03:40,725 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-19 22:03:40,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 22:03:40,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 22:03:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-19 22:03:41,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:03:41,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-07-19 22:03:41,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:03:41,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:03:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-19 22:03:41,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502020382] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:03:41,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:03:41,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 12] total 31 [2022-07-19 22:03:41,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641335553] [2022-07-19 22:03:41,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:03:41,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-19 22:03:41,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:41,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-19 22:03:41,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2022-07-19 22:03:41,410 INFO L87 Difference]: Start difference. First operand 187 states and 266 transitions. Second operand has 31 states, 27 states have (on average 4.074074074074074) internal successors, (110), 24 states have internal predecessors, (110), 14 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (54), 11 states have call predecessors, (54), 13 states have call successors, (54) [2022-07-19 22:03:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:44,349 INFO L93 Difference]: Finished difference Result 495 states and 722 transitions. [2022-07-19 22:03:44,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-19 22:03:44,350 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 4.074074074074074) internal successors, (110), 24 states have internal predecessors, (110), 14 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (54), 11 states have call predecessors, (54), 13 states have call successors, (54) Word has length 132 [2022-07-19 22:03:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:44,352 INFO L225 Difference]: With dead ends: 495 [2022-07-19 22:03:44,352 INFO L226 Difference]: Without dead ends: 288 [2022-07-19 22:03:44,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 286 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=281, Invalid=2911, Unknown=0, NotChecked=0, Total=3192 [2022-07-19 22:03:44,354 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 346 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 3923 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 4668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 3923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 410 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:44,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1296 Invalid, 4668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 3923 Invalid, 0 Unknown, 410 Unchecked, 2.2s Time] [2022-07-19 22:03:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-07-19 22:03:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 273. [2022-07-19 22:03:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 158 states have (on average 1.1962025316455696) internal successors, (189), 164 states have internal predecessors, (189), 95 states have call successors, (95), 15 states have call predecessors, (95), 19 states have return successors, (123), 93 states have call predecessors, (123), 94 states have call successors, (123) [2022-07-19 22:03:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 407 transitions. [2022-07-19 22:03:44,378 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 407 transitions. Word has length 132 [2022-07-19 22:03:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:44,378 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 407 transitions. [2022-07-19 22:03:44,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 4.074074074074074) internal successors, (110), 24 states have internal predecessors, (110), 14 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (54), 11 states have call predecessors, (54), 13 states have call successors, (54) [2022-07-19 22:03:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 407 transitions. [2022-07-19 22:03:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-19 22:03:44,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:44,380 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:44,403 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-19 22:03:44,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:44,600 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:44,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:44,600 INFO L85 PathProgramCache]: Analyzing trace with hash -132654696, now seen corresponding path program 1 times [2022-07-19 22:03:44,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:44,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467389302] [2022-07-19 22:03:44,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:44,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:44,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:03:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:44,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:03:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:44,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:03:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:44,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:03:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:44,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:03:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:44,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:03:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:44,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:03:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:44,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:03:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:44,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:03:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:44,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:03:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:03:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:03:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:03:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:03:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 22:03:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:03:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:03:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:03:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:03:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 22:03:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-19 22:03:45,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:45,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467389302] [2022-07-19 22:03:45,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467389302] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:45,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115981827] [2022-07-19 22:03:45,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:45,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:45,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:45,267 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-19 22:03:45,303 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-19 22:03:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 2766 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-19 22:03:45,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:03:45,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 22:03:46,096 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-19 22:03:46,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-07-19 22:03:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 132 proven. 16 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-19 22:03:49,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:03:56,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115981827] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:56,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:03:56,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 36 [2022-07-19 22:03:56,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210747881] [2022-07-19 22:03:56,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:03:56,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-19 22:03:56,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:56,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-19 22:03:56,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1412, Unknown=4, NotChecked=0, Total=1560 [2022-07-19 22:03:56,406 INFO L87 Difference]: Start difference. First operand 273 states and 407 transitions. Second operand has 36 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 31 states have internal predecessors, (110), 14 states have call successors, (43), 10 states have call predecessors, (43), 9 states have return successors, (39), 11 states have call predecessors, (39), 12 states have call successors, (39) [2022-07-19 22:04:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:06,491 INFO L93 Difference]: Finished difference Result 727 states and 1106 transitions. [2022-07-19 22:04:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-19 22:04:06,492 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 31 states have internal predecessors, (110), 14 states have call successors, (43), 10 states have call predecessors, (43), 9 states have return successors, (39), 11 states have call predecessors, (39), 12 states have call successors, (39) Word has length 143 [2022-07-19 22:04:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:06,498 INFO L225 Difference]: With dead ends: 727 [2022-07-19 22:04:06,498 INFO L226 Difference]: Without dead ends: 534 [2022-07-19 22:04:06,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 234 SyntacticMatches, 24 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1781 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=511, Invalid=5029, Unknown=10, NotChecked=0, Total=5550 [2022-07-19 22:04:06,505 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 404 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 3911 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 6258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 3911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1991 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:06,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1941 Invalid, 6258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 3911 Invalid, 0 Unknown, 1991 Unchecked, 2.6s Time] [2022-07-19 22:04:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-07-19 22:04:06,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 423. [2022-07-19 22:04:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 248 states have (on average 1.1774193548387097) internal successors, (292), 255 states have internal predecessors, (292), 147 states have call successors, (147), 22 states have call predecessors, (147), 27 states have return successors, (187), 145 states have call predecessors, (187), 146 states have call successors, (187) [2022-07-19 22:04:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 626 transitions. [2022-07-19 22:04:06,550 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 626 transitions. Word has length 143 [2022-07-19 22:04:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:06,551 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 626 transitions. [2022-07-19 22:04:06,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 31 states have internal predecessors, (110), 14 states have call successors, (43), 10 states have call predecessors, (43), 9 states have return successors, (39), 11 states have call predecessors, (39), 12 states have call successors, (39) [2022-07-19 22:04:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 626 transitions. [2022-07-19 22:04:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-19 22:04:06,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:06,554 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:06,579 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-19 22:04:06,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:06,772 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:06,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:06,773 INFO L85 PathProgramCache]: Analyzing trace with hash -845476291, now seen corresponding path program 1 times [2022-07-19 22:04:06,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:06,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447796943] [2022-07-19 22:04:06,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:06,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:06,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:06,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:06,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:04:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:06,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:06,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:06,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:06,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:06,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:06,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:04:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:06,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:04:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:04:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:06,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:04:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:06,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:04:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:07,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:04:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:07,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:04:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:07,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 22:04:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:07,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:04:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:07,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:04:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:07,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:04:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:07,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:04:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:07,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 22:04:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-19 22:04:07,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:07,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447796943] [2022-07-19 22:04:07,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447796943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:07,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:07,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 22:04:07,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699770248] [2022-07-19 22:04:07,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:07,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 22:04:07,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:07,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 22:04:07,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:04:07,124 INFO L87 Difference]: Start difference. First operand 423 states and 626 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-19 22:04:08,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:08,085 INFO L93 Difference]: Finished difference Result 449 states and 678 transitions. [2022-07-19 22:04:08,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 22:04:08,085 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2022-07-19 22:04:08,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:08,088 INFO L225 Difference]: With dead ends: 449 [2022-07-19 22:04:08,088 INFO L226 Difference]: Without dead ends: 447 [2022-07-19 22:04:08,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-07-19 22:04:08,089 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 161 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:08,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 778 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 22:04:08,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-07-19 22:04:08,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2022-07-19 22:04:08,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 261 states have (on average 1.1685823754789273) internal successors, (305), 270 states have internal predecessors, (305), 151 states have call successors, (151), 23 states have call predecessors, (151), 30 states have return successors, (216), 149 states have call predecessors, (216), 150 states have call successors, (216) [2022-07-19 22:04:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 672 transitions. [2022-07-19 22:04:08,130 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 672 transitions. Word has length 145 [2022-07-19 22:04:08,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:08,130 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 672 transitions. [2022-07-19 22:04:08,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-19 22:04:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 672 transitions. [2022-07-19 22:04:08,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-19 22:04:08,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:08,134 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:08,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 22:04:08,134 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:08,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:08,134 INFO L85 PathProgramCache]: Analyzing trace with hash -144411713, now seen corresponding path program 1 times [2022-07-19 22:04:08,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:08,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507992023] [2022-07-19 22:04:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:08,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:04:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:04:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:04:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:04:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:04:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:04:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:04:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:04:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 22:04:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:04:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:04:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:04:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:04:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 22:04:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-19 22:04:08,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:08,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507992023] [2022-07-19 22:04:08,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507992023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:08,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:08,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-19 22:04:08,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436466319] [2022-07-19 22:04:08,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:08,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 22:04:08,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:08,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 22:04:08,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-19 22:04:08,613 INFO L87 Difference]: Start difference. First operand 443 states and 672 transitions. Second operand has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-19 22:04:09,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:09,742 INFO L93 Difference]: Finished difference Result 460 states and 712 transitions. [2022-07-19 22:04:09,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 22:04:09,743 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2022-07-19 22:04:09,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:09,746 INFO L225 Difference]: With dead ends: 460 [2022-07-19 22:04:09,746 INFO L226 Difference]: Without dead ends: 458 [2022-07-19 22:04:09,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2022-07-19 22:04:09,747 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 241 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:09,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 901 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 22:04:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-07-19 22:04:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 435. [2022-07-19 22:04:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 255 states have (on average 1.1725490196078432) internal successors, (299), 263 states have internal predecessors, (299), 150 states have call successors, (150), 23 states have call predecessors, (150), 29 states have return successors, (212), 148 states have call predecessors, (212), 149 states have call successors, (212) [2022-07-19 22:04:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 661 transitions. [2022-07-19 22:04:09,777 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 661 transitions. Word has length 145 [2022-07-19 22:04:09,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:09,777 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 661 transitions. [2022-07-19 22:04:09,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-19 22:04:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 661 transitions. [2022-07-19 22:04:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-19 22:04:09,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:09,779 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:09,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 22:04:09,780 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1764210556, now seen corresponding path program 1 times [2022-07-19 22:04:09,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:09,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522964732] [2022-07-19 22:04:09,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:09,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:09,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:09,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:09,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:04:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:04:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:04:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:04:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:04:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:04:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 22:04:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:04:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 22:04:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 22:04:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:04:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:04:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 22:04:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 22:04:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 22:04:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 19 proven. 24 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-07-19 22:04:10,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:10,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522964732] [2022-07-19 22:04:10,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522964732] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:04:10,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955134805] [2022-07-19 22:04:10,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:10,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:10,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:04:10,176 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-19 22:04:10,177 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-19 22:04:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:10,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 2825 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 22:04:10,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:04:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-19 22:04:10,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:04:10,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955134805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:10,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:04:10,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 13 [2022-07-19 22:04:10,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792091462] [2022-07-19 22:04:10,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:10,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:04:10,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:10,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:04:10,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:04:10,645 INFO L87 Difference]: Start difference. First operand 435 states and 661 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-19 22:04:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:10,874 INFO L93 Difference]: Finished difference Result 746 states and 1137 transitions. [2022-07-19 22:04:10,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:04:10,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 154 [2022-07-19 22:04:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:10,878 INFO L225 Difference]: With dead ends: 746 [2022-07-19 22:04:10,878 INFO L226 Difference]: Without dead ends: 435 [2022-07-19 22:04:10,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-19 22:04:10,881 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 12 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:10,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1424 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:04:10,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-07-19 22:04:10,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2022-07-19 22:04:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 255 states have (on average 1.1725490196078432) internal successors, (299), 263 states have internal predecessors, (299), 150 states have call successors, (150), 23 states have call predecessors, (150), 29 states have return successors, (208), 148 states have call predecessors, (208), 149 states have call successors, (208) [2022-07-19 22:04:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 657 transitions. [2022-07-19 22:04:10,923 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 657 transitions. Word has length 154 [2022-07-19 22:04:10,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:10,924 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 657 transitions. [2022-07-19 22:04:10,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-19 22:04:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 657 transitions. [2022-07-19 22:04:10,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-19 22:04:10,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:10,926 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:10,952 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-19 22:04:11,139 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-19 22:04:11,139 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:11,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:11,140 INFO L85 PathProgramCache]: Analyzing trace with hash -386866604, now seen corresponding path program 1 times [2022-07-19 22:04:11,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:11,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745191726] [2022-07-19 22:04:11,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:11,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:04:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:04:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:04:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:04:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:04:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:04:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:04:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:04:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 22:04:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:04:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:04:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:04:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:04:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 22:04:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 22:04:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:04:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2022-07-19 22:04:11,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:11,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745191726] [2022-07-19 22:04:11,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745191726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:11,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:11,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:04:11,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125317535] [2022-07-19 22:04:11,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:11,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:04:11,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:11,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:04:11,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:04:11,519 INFO L87 Difference]: Start difference. First operand 435 states and 657 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-19 22:04:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:12,180 INFO L93 Difference]: Finished difference Result 451 states and 677 transitions. [2022-07-19 22:04:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 22:04:12,180 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) Word has length 153 [2022-07-19 22:04:12,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:12,183 INFO L225 Difference]: With dead ends: 451 [2022-07-19 22:04:12,183 INFO L226 Difference]: Without dead ends: 449 [2022-07-19 22:04:12,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:04:12,184 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 151 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:12,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 640 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 22:04:12,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-07-19 22:04:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 444. [2022-07-19 22:04:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 258 states have (on average 1.1705426356589148) internal successors, (302), 266 states have internal predecessors, (302), 155 states have call successors, (155), 24 states have call predecessors, (155), 30 states have return successors, (213), 153 states have call predecessors, (213), 154 states have call successors, (213) [2022-07-19 22:04:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 670 transitions. [2022-07-19 22:04:12,224 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 670 transitions. Word has length 153 [2022-07-19 22:04:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:12,224 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 670 transitions. [2022-07-19 22:04:12,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-19 22:04:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 670 transitions. [2022-07-19 22:04:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-19 22:04:12,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:12,226 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:12,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 22:04:12,227 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:12,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1630309929, now seen corresponding path program 1 times [2022-07-19 22:04:12,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:12,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240417284] [2022-07-19 22:04:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:12,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:04:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:04:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:04:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:04:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:04:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:04:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 22:04:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:04:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:04:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:04:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 22:04:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:04:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 22:04:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 22:04:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 22:04:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2022-07-19 22:04:12,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:12,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240417284] [2022-07-19 22:04:12,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240417284] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:04:12,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134810610] [2022-07-19 22:04:12,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:12,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:12,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:04:12,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-19 22:04:12,567 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-19 22:04:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:12,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 2830 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 22:04:12,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:04:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-07-19 22:04:13,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:04:13,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134810610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:13,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:04:13,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2022-07-19 22:04:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969635258] [2022-07-19 22:04:13,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:13,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:04:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:04:13,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:04:13,096 INFO L87 Difference]: Start difference. First operand 444 states and 670 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-19 22:04:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:13,269 INFO L93 Difference]: Finished difference Result 823 states and 1278 transitions. [2022-07-19 22:04:13,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:04:13,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 156 [2022-07-19 22:04:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:13,272 INFO L225 Difference]: With dead ends: 823 [2022-07-19 22:04:13,272 INFO L226 Difference]: Without dead ends: 444 [2022-07-19 22:04:13,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:04:13,275 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 15 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:13,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 696 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-07-19 22:04:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-07-19 22:04:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2022-07-19 22:04:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 258 states have (on average 1.1627906976744187) internal successors, (300), 266 states have internal predecessors, (300), 155 states have call successors, (155), 24 states have call predecessors, (155), 30 states have return successors, (213), 153 states have call predecessors, (213), 154 states have call successors, (213) [2022-07-19 22:04:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 668 transitions. [2022-07-19 22:04:13,305 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 668 transitions. Word has length 156 [2022-07-19 22:04:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:13,306 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 668 transitions. [2022-07-19 22:04:13,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-19 22:04:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 668 transitions. [2022-07-19 22:04:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-19 22:04:13,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:13,308 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:13,345 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-19 22:04:13,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-19 22:04:13,523 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1137683755, now seen corresponding path program 1 times [2022-07-19 22:04:13,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:13,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078756809] [2022-07-19 22:04:13,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:13,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:13,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:13,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:13,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:04:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:13,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:13,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:04:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:04:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:04:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:04:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:04:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 22:04:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:04:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:04:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:04:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 22:04:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:04:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 22:04:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 22:04:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 22:04:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2022-07-19 22:04:14,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:14,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078756809] [2022-07-19 22:04:14,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078756809] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:04:14,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811103761] [2022-07-19 22:04:14,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:14,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:14,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:04:14,480 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-19 22:04:14,490 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-19 22:04:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:14,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 2835 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-19 22:04:14,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:04:15,405 INFO L356 Elim1Store]: treesize reduction 70, result has 26.3 percent of original size [2022-07-19 22:04:15,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 39 [2022-07-19 22:04:15,505 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 22:04:15,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2022-07-19 22:04:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 160 proven. 12 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-19 22:04:15,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:04:15,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-19 22:04:16,014 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 22:04:16,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2022-07-19 22:04:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2022-07-19 22:04:16,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811103761] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:04:16,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:04:16,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 13, 11] total 41 [2022-07-19 22:04:16,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318963585] [2022-07-19 22:04:16,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:04:16,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-19 22:04:16,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:16,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-19 22:04:16,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1521, Unknown=0, NotChecked=0, Total=1640 [2022-07-19 22:04:16,067 INFO L87 Difference]: Start difference. First operand 444 states and 668 transitions. Second operand has 41 states, 37 states have (on average 3.675675675675676) internal successors, (136), 36 states have internal predecessors, (136), 16 states have call successors, (56), 9 states have call predecessors, (56), 12 states have return successors, (53), 14 states have call predecessors, (53), 16 states have call successors, (53) [2022-07-19 22:04:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:22,021 INFO L93 Difference]: Finished difference Result 937 states and 1448 transitions. [2022-07-19 22:04:22,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-19 22:04:22,021 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 3.675675675675676) internal successors, (136), 36 states have internal predecessors, (136), 16 states have call successors, (56), 9 states have call predecessors, (56), 12 states have return successors, (53), 14 states have call predecessors, (53), 16 states have call successors, (53) Word has length 156 [2022-07-19 22:04:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:22,025 INFO L225 Difference]: With dead ends: 937 [2022-07-19 22:04:22,025 INFO L226 Difference]: Without dead ends: 652 [2022-07-19 22:04:22,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 331 SyntacticMatches, 11 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=487, Invalid=5063, Unknown=0, NotChecked=0, Total=5550 [2022-07-19 22:04:22,028 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 277 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 7788 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 8673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 7788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 578 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:22,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1683 Invalid, 8673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 7788 Invalid, 0 Unknown, 578 Unchecked, 4.5s Time] [2022-07-19 22:04:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-07-19 22:04:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 533. [2022-07-19 22:04:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 309 states have (on average 1.1715210355987056) internal successors, (362), 315 states have internal predecessors, (362), 191 states have call successors, (191), 28 states have call predecessors, (191), 32 states have return successors, (258), 189 states have call predecessors, (258), 190 states have call successors, (258) [2022-07-19 22:04:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 811 transitions. [2022-07-19 22:04:22,065 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 811 transitions. Word has length 156 [2022-07-19 22:04:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:22,065 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 811 transitions. [2022-07-19 22:04:22,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 3.675675675675676) internal successors, (136), 36 states have internal predecessors, (136), 16 states have call successors, (56), 9 states have call predecessors, (56), 12 states have return successors, (53), 14 states have call predecessors, (53), 16 states have call successors, (53) [2022-07-19 22:04:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 811 transitions. [2022-07-19 22:04:22,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-19 22:04:22,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:22,068 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:22,090 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-19 22:04:22,291 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-19 22:04:22,291 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:22,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:22,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1267128233, now seen corresponding path program 2 times [2022-07-19 22:04:22,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:22,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096237332] [2022-07-19 22:04:22,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:22,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:22,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:22,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:22,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:04:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:22,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:22,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:22,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:22,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:22,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:22,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:04:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:22,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:04:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:04:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:04:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 22:04:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 22:04:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:04:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:04:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:04:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 22:04:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:04:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 22:04:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 22:04:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 22:04:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-07-19 22:04:23,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:23,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096237332] [2022-07-19 22:04:23,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096237332] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:04:23,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019456632] [2022-07-19 22:04:23,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 22:04:23,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:23,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:04:23,059 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-19 22:04:23,095 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-19 22:04:24,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 22:04:24,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:04:24,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 2835 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-19 22:04:24,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:04:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 133 proven. 9 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-19 22:04:25,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:04:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 43 proven. 9 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-07-19 22:04:25,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019456632] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:04:25,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:04:25,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 15] total 52 [2022-07-19 22:04:25,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240045101] [2022-07-19 22:04:25,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:04:25,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-19 22:04:25,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:25,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-19 22:04:25,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2485, Unknown=0, NotChecked=0, Total=2652 [2022-07-19 22:04:25,864 INFO L87 Difference]: Start difference. First operand 533 states and 811 transitions. Second operand has 52 states, 45 states have (on average 3.1777777777777776) internal successors, (143), 44 states have internal predecessors, (143), 17 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (62), 14 states have call predecessors, (62), 16 states have call successors, (62) [2022-07-19 22:04:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:30,785 INFO L93 Difference]: Finished difference Result 834 states and 1265 transitions. [2022-07-19 22:04:30,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-19 22:04:30,786 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 45 states have (on average 3.1777777777777776) internal successors, (143), 44 states have internal predecessors, (143), 17 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (62), 14 states have call predecessors, (62), 16 states have call successors, (62) Word has length 156 [2022-07-19 22:04:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:30,805 INFO L225 Difference]: With dead ends: 834 [2022-07-19 22:04:30,805 INFO L226 Difference]: Without dead ends: 612 [2022-07-19 22:04:30,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 325 SyntacticMatches, 6 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2517 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=716, Invalid=9184, Unknown=0, NotChecked=0, Total=9900 [2022-07-19 22:04:30,812 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 423 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 6605 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 7982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 6605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 962 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:30,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1670 Invalid, 7982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 6605 Invalid, 0 Unknown, 962 Unchecked, 3.2s Time] [2022-07-19 22:04:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-07-19 22:04:30,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 571. [2022-07-19 22:04:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 341 states have (on average 1.1759530791788857) internal successors, (401), 347 states have internal predecessors, (401), 193 states have call successors, (193), 32 states have call predecessors, (193), 36 states have return successors, (280), 191 states have call predecessors, (280), 192 states have call successors, (280) [2022-07-19 22:04:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 874 transitions. [2022-07-19 22:04:30,881 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 874 transitions. Word has length 156 [2022-07-19 22:04:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:30,882 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 874 transitions. [2022-07-19 22:04:30,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 45 states have (on average 3.1777777777777776) internal successors, (143), 44 states have internal predecessors, (143), 17 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (62), 14 states have call predecessors, (62), 16 states have call successors, (62) [2022-07-19 22:04:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 874 transitions. [2022-07-19 22:04:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-19 22:04:30,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:30,885 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:30,908 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-19 22:04:31,105 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-19 22:04:31,105 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:31,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:31,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1021216476, now seen corresponding path program 1 times [2022-07-19 22:04:31,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:31,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963720473] [2022-07-19 22:04:31,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:31,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:04:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:04:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:04:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:04:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:04:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:04:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:04:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:04:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 22:04:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:04:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:04:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:04:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:04:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 22:04:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 22:04:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:04:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-07-19 22:04:31,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:31,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963720473] [2022-07-19 22:04:31,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963720473] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:04:31,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418196447] [2022-07-19 22:04:31,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:31,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:31,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:04:31,554 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-19 22:04:31,556 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-19 22:04:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 2798 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-19 22:04:31,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:04:32,097 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-19 22:04:32,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-19 22:04:32,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-19 22:04:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-19 22:04:33,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:04:33,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418196447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:33,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:04:33,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [16] total 32 [2022-07-19 22:04:33,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876377352] [2022-07-19 22:04:33,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:33,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 22:04:33,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:33,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 22:04:33,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2022-07-19 22:04:33,225 INFO L87 Difference]: Start difference. First operand 571 states and 874 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 7 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-19 22:04:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:33,948 INFO L93 Difference]: Finished difference Result 878 states and 1297 transitions. [2022-07-19 22:04:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 22:04:33,949 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 7 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) Word has length 157 [2022-07-19 22:04:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:33,971 INFO L225 Difference]: With dead ends: 878 [2022-07-19 22:04:33,971 INFO L226 Difference]: Without dead ends: 673 [2022-07-19 22:04:33,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 161 SyntacticMatches, 28 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=149, Invalid=1657, Unknown=0, NotChecked=0, Total=1806 [2022-07-19 22:04:33,973 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 156 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 766 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:33,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 884 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1240 Invalid, 0 Unknown, 766 Unchecked, 0.5s Time] [2022-07-19 22:04:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-07-19 22:04:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 652. [2022-07-19 22:04:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 396 states have (on average 1.1717171717171717) internal successors, (464), 403 states have internal predecessors, (464), 211 states have call successors, (211), 39 states have call predecessors, (211), 44 states have return successors, (306), 209 states have call predecessors, (306), 210 states have call successors, (306) [2022-07-19 22:04:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 981 transitions. [2022-07-19 22:04:34,080 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 981 transitions. Word has length 157 [2022-07-19 22:04:34,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:34,080 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 981 transitions. [2022-07-19 22:04:34,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 16 states have internal predecessors, (64), 7 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-19 22:04:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 981 transitions. [2022-07-19 22:04:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-19 22:04:34,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:34,082 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:34,117 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-19 22:04:34,302 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-19 22:04:34,303 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:34,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1279381914, now seen corresponding path program 1 times [2022-07-19 22:04:34,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:34,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674881058] [2022-07-19 22:04:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:34,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:04:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:04:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:04:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:04:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:04:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:04:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:04:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:04:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 22:04:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:04:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:04:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:04:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:04:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 22:04:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 22:04:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:04:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-07-19 22:04:34,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:34,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674881058] [2022-07-19 22:04:34,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674881058] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:34,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:34,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:04:34,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086172628] [2022-07-19 22:04:34,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:34,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:04:34,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:34,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:04:34,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:04:34,532 INFO L87 Difference]: Start difference. First operand 652 states and 981 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-19 22:04:34,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:34,964 INFO L93 Difference]: Finished difference Result 1252 states and 1929 transitions. [2022-07-19 22:04:34,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:04:34,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) Word has length 157 [2022-07-19 22:04:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:34,967 INFO L225 Difference]: With dead ends: 1252 [2022-07-19 22:04:34,968 INFO L226 Difference]: Without dead ends: 635 [2022-07-19 22:04:34,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:04:34,971 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 202 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:34,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 343 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 22:04:34,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-07-19 22:04:35,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2022-07-19 22:04:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 384 states have (on average 1.1588541666666667) internal successors, (445), 389 states have internal predecessors, (445), 208 states have call successors, (208), 39 states have call predecessors, (208), 42 states have return successors, (278), 206 states have call predecessors, (278), 207 states have call successors, (278) [2022-07-19 22:04:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 931 transitions. [2022-07-19 22:04:35,011 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 931 transitions. Word has length 157 [2022-07-19 22:04:35,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:35,012 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 931 transitions. [2022-07-19 22:04:35,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-19 22:04:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 931 transitions. [2022-07-19 22:04:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-19 22:04:35,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:35,014 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:35,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 22:04:35,014 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:35,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:35,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1258471427, now seen corresponding path program 1 times [2022-07-19 22:04:35,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:35,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852080750] [2022-07-19 22:04:35,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:35,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:04:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:04:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:04:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:04:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:04:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:04:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:04:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:04:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 22:04:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:04:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:04:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:04:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:04:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 22:04:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 22:04:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:04:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:35,336 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2022-07-19 22:04:35,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:35,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852080750] [2022-07-19 22:04:35,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852080750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:35,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:35,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-19 22:04:35,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236727359] [2022-07-19 22:04:35,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:35,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 22:04:35,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:35,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 22:04:35,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-19 22:04:35,338 INFO L87 Difference]: Start difference. First operand 635 states and 931 transitions. Second operand has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-19 22:04:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:36,538 INFO L93 Difference]: Finished difference Result 658 states and 959 transitions. [2022-07-19 22:04:36,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 22:04:36,539 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2022-07-19 22:04:36,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:36,542 INFO L225 Difference]: With dead ends: 658 [2022-07-19 22:04:36,542 INFO L226 Difference]: Without dead ends: 656 [2022-07-19 22:04:36,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2022-07-19 22:04:36,543 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 227 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:36,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 899 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 22:04:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-07-19 22:04:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 645. [2022-07-19 22:04:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 387 states have (on average 1.1576227390180878) internal successors, (448), 392 states have internal predecessors, (448), 214 states have call successors, (214), 40 states have call predecessors, (214), 43 states have return successors, (284), 212 states have call predecessors, (284), 213 states have call successors, (284) [2022-07-19 22:04:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 946 transitions. [2022-07-19 22:04:36,613 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 946 transitions. Word has length 159 [2022-07-19 22:04:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:36,614 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 946 transitions. [2022-07-19 22:04:36,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-19 22:04:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 946 transitions. [2022-07-19 22:04:36,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-19 22:04:36,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:36,616 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:36,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 22:04:36,617 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:36,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:36,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1665943078, now seen corresponding path program 1 times [2022-07-19 22:04:36,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:36,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890983925] [2022-07-19 22:04:36,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:36,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:04:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:04:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:04:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:04:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:04:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:04:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 22:04:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:04:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:04:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:04:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:04:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 22:04:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 22:04:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:04:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-07-19 22:04:36,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:36,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890983925] [2022-07-19 22:04:36,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890983925] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:36,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:36,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:04:36,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530112609] [2022-07-19 22:04:36,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:36,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:04:36,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:36,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:04:36,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:04:36,968 INFO L87 Difference]: Start difference. First operand 645 states and 946 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2022-07-19 22:04:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:37,368 INFO L93 Difference]: Finished difference Result 957 states and 1406 transitions. [2022-07-19 22:04:37,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:04:37,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2022-07-19 22:04:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:37,372 INFO L225 Difference]: With dead ends: 957 [2022-07-19 22:04:37,372 INFO L226 Difference]: Without dead ends: 669 [2022-07-19 22:04:37,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:04:37,374 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 131 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:37,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 346 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 22:04:37,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-07-19 22:04:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 663. [2022-07-19 22:04:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 400 states have (on average 1.1525) internal successors, (461), 406 states have internal predecessors, (461), 214 states have call successors, (214), 40 states have call predecessors, (214), 48 states have return successors, (292), 216 states have call predecessors, (292), 213 states have call successors, (292) [2022-07-19 22:04:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 967 transitions. [2022-07-19 22:04:37,441 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 967 transitions. Word has length 164 [2022-07-19 22:04:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:37,441 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 967 transitions. [2022-07-19 22:04:37,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2022-07-19 22:04:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 967 transitions. [2022-07-19 22:04:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-19 22:04:37,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:37,444 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:37,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 22:04:37,444 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:37,444 INFO L85 PathProgramCache]: Analyzing trace with hash -448225397, now seen corresponding path program 1 times [2022-07-19 22:04:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:37,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411773597] [2022-07-19 22:04:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:37,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:04:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:04:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:04:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:04:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:04:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:04:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:04:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:04:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:04:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:04:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:04:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:04:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 22:04:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 22:04:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 22:04:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:04:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 22:04:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2022-07-19 22:04:37,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:37,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411773597] [2022-07-19 22:04:37,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411773597] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:04:37,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477012374] [2022-07-19 22:04:37,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:37,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:37,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:04:37,967 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-19 22:04:38,010 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-19 22:04:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:38,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 2820 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-19 22:04:38,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:04:38,632 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-19 22:04:39,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:04:39,410 INFO L356 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2022-07-19 22:04:39,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 40 [2022-07-19 22:04:39,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-19 22:04:39,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-19 22:04:39,562 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 22:04:39,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2022-07-19 22:04:39,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 22:04:39,680 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-19 22:04:39,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:04:40,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2022-07-19 22:04:40,406 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 22:04:40,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-19 22:04:40,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2022-07-19 22:04:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2022-07-19 22:04:40,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477012374] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:04:40,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:04:40,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 18] total 53 [2022-07-19 22:04:40,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249116135] [2022-07-19 22:04:40,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:04:40,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-19 22:04:40,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:40,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-19 22:04:40,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2551, Unknown=0, NotChecked=0, Total=2756 [2022-07-19 22:04:40,722 INFO L87 Difference]: Start difference. First operand 663 states and 967 transitions. Second operand has 53 states, 47 states have (on average 3.5531914893617023) internal successors, (167), 44 states have internal predecessors, (167), 20 states have call successors, (59), 10 states have call predecessors, (59), 17 states have return successors, (57), 18 states have call predecessors, (57), 20 states have call successors, (57) [2022-07-19 22:04:43,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:43,454 INFO L93 Difference]: Finished difference Result 936 states and 1299 transitions. [2022-07-19 22:04:43,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-19 22:04:43,455 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 47 states have (on average 3.5531914893617023) internal successors, (167), 44 states have internal predecessors, (167), 20 states have call successors, (59), 10 states have call predecessors, (59), 17 states have return successors, (57), 18 states have call predecessors, (57), 20 states have call successors, (57) Word has length 163 [2022-07-19 22:04:43,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:43,457 INFO L225 Difference]: With dead ends: 936 [2022-07-19 22:04:43,458 INFO L226 Difference]: Without dead ends: 682 [2022-07-19 22:04:43,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 341 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2020 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=673, Invalid=6809, Unknown=0, NotChecked=0, Total=7482 [2022-07-19 22:04:43,460 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 467 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 3476 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 4618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 3476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 754 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:43,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1416 Invalid, 4618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 3476 Invalid, 0 Unknown, 754 Unchecked, 1.7s Time] [2022-07-19 22:04:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-07-19 22:04:43,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 609. [2022-07-19 22:04:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 382 states have (on average 1.143979057591623) internal successors, (437), 387 states have internal predecessors, (437), 177 states have call successors, (177), 43 states have call predecessors, (177), 49 states have return successors, (238), 178 states have call predecessors, (238), 176 states have call successors, (238) [2022-07-19 22:04:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 852 transitions. [2022-07-19 22:04:43,538 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 852 transitions. Word has length 163 [2022-07-19 22:04:43,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:43,539 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 852 transitions. [2022-07-19 22:04:43,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 47 states have (on average 3.5531914893617023) internal successors, (167), 44 states have internal predecessors, (167), 20 states have call successors, (59), 10 states have call predecessors, (59), 17 states have return successors, (57), 18 states have call predecessors, (57), 20 states have call successors, (57) [2022-07-19 22:04:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 852 transitions. [2022-07-19 22:04:43,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-19 22:04:43,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:43,541 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:43,573 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-19 22:04:43,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 22:04:43,756 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:43,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:43,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1049417710, now seen corresponding path program 1 times [2022-07-19 22:04:43,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:43,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125579586] [2022-07-19 22:04:43,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:43,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:04:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:04:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:04:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:04:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:04:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:04:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:04:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 22:04:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:04:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:04:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:04:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:04:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 22:04:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 22:04:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:04:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 7 proven. 87 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-07-19 22:04:44,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:44,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125579586] [2022-07-19 22:04:44,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125579586] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:04:44,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23192188] [2022-07-19 22:04:44,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:44,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:44,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:04:44,914 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-19 22:04:44,915 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-19 22:04:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:45,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 2817 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-19 22:04:45,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:04:45,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 22:04:45,964 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-19 22:04:45,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-07-19 22:04:49,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-07-19 22:04:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-19 22:04:50,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:05:22,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23192188] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:22,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:05:22,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 21] total 49 [2022-07-19 22:05:22,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245831263] [2022-07-19 22:05:22,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:05:22,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-19 22:05:22,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:22,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-19 22:05:22,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2627, Unknown=16, NotChecked=0, Total=2862 [2022-07-19 22:05:22,070 INFO L87 Difference]: Start difference. First operand 609 states and 852 transitions. Second operand has 49 states, 38 states have (on average 3.3947368421052633) internal successors, (129), 41 states have internal predecessors, (129), 21 states have call successors, (52), 8 states have call predecessors, (52), 12 states have return successors, (50), 14 states have call predecessors, (50), 19 states have call successors, (50) [2022-07-19 22:05:37,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:37,758 INFO L93 Difference]: Finished difference Result 822 states and 1124 transitions. [2022-07-19 22:05:37,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-19 22:05:37,759 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 38 states have (on average 3.3947368421052633) internal successors, (129), 41 states have internal predecessors, (129), 21 states have call successors, (52), 8 states have call predecessors, (52), 12 states have return successors, (50), 14 states have call predecessors, (50), 19 states have call successors, (50) Word has length 165 [2022-07-19 22:05:37,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:37,762 INFO L225 Difference]: With dead ends: 822 [2022-07-19 22:05:37,762 INFO L226 Difference]: Without dead ends: 752 [2022-07-19 22:05:37,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 304 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2809 ImplicationChecksByTransitivity, 48.5s TimeCoverageRelationStatistics Valid=750, Invalid=9323, Unknown=27, NotChecked=0, Total=10100 [2022-07-19 22:05:37,764 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 570 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 5200 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 7104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 5200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1421 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:37,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1707 Invalid, 7104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 5200 Invalid, 0 Unknown, 1421 Unchecked, 3.1s Time] [2022-07-19 22:05:37,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-07-19 22:05:37,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 665. [2022-07-19 22:05:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 419 states have (on average 1.1288782816229117) internal successors, (473), 423 states have internal predecessors, (473), 189 states have call successors, (189), 51 states have call predecessors, (189), 56 states have return successors, (250), 190 states have call predecessors, (250), 188 states have call successors, (250) [2022-07-19 22:05:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 912 transitions. [2022-07-19 22:05:37,807 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 912 transitions. Word has length 165 [2022-07-19 22:05:37,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:37,807 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 912 transitions. [2022-07-19 22:05:37,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 38 states have (on average 3.3947368421052633) internal successors, (129), 41 states have internal predecessors, (129), 21 states have call successors, (52), 8 states have call predecessors, (52), 12 states have return successors, (50), 14 states have call predecessors, (50), 19 states have call successors, (50) [2022-07-19 22:05:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 912 transitions. [2022-07-19 22:05:37,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-19 22:05:37,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:37,826 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:37,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-19 22:05:38,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:38,038 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:38,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:38,040 INFO L85 PathProgramCache]: Analyzing trace with hash -260269898, now seen corresponding path program 1 times [2022-07-19 22:05:38,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:38,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703733270] [2022-07-19 22:05:38,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:38,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:05:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:05:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:05:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:05:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:05:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:05:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 22:05:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:05:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:05:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 22:05:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 22:05:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:05:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 22:05:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 22:05:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:05:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:05:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 22:05:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 22:05:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 22:05:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 22:05:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 22:05:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 39 proven. 24 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-07-19 22:05:38,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:38,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703733270] [2022-07-19 22:05:38,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703733270] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:38,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001130833] [2022-07-19 22:05:38,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:38,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:38,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:39,016 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-19 22:05:39,017 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-19 22:05:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:39,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 2857 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 22:05:39,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-19 22:05:39,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:05:39,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001130833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:39,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:05:39,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [32] total 38 [2022-07-19 22:05:39,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979426411] [2022-07-19 22:05:39,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:39,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:05:39,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:39,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:05:39,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1307, Unknown=0, NotChecked=0, Total=1406 [2022-07-19 22:05:39,626 INFO L87 Difference]: Start difference. First operand 665 states and 912 transitions. Second operand has 9 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-19 22:05:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:39,863 INFO L93 Difference]: Finished difference Result 1044 states and 1453 transitions. [2022-07-19 22:05:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:05:39,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 168 [2022-07-19 22:05:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:39,867 INFO L225 Difference]: With dead ends: 1044 [2022-07-19 22:05:39,867 INFO L226 Difference]: Without dead ends: 665 [2022-07-19 22:05:39,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=1526, Unknown=0, NotChecked=0, Total=1640 [2022-07-19 22:05:39,870 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 10 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:39,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1398 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:05:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-07-19 22:05:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2022-07-19 22:05:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 419 states have (on average 1.126491646778043) internal successors, (472), 423 states have internal predecessors, (472), 189 states have call successors, (189), 51 states have call predecessors, (189), 56 states have return successors, (250), 190 states have call predecessors, (250), 188 states have call successors, (250) [2022-07-19 22:05:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 911 transitions. [2022-07-19 22:05:39,916 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 911 transitions. Word has length 168 [2022-07-19 22:05:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:39,916 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 911 transitions. [2022-07-19 22:05:39,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-19 22:05:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 911 transitions. [2022-07-19 22:05:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-19 22:05:39,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:39,918 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:39,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 22:05:40,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:40,146 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:40,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:40,146 INFO L85 PathProgramCache]: Analyzing trace with hash 719923375, now seen corresponding path program 1 times [2022-07-19 22:05:40,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:40,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082150384] [2022-07-19 22:05:40,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:40,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:40,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:40,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:05:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:40,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:05:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:40,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:40,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:05:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:40,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:40,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:05:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:40,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:05:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:40,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:05:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:40,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:05:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:40,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:05:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:40,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:05:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:40,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:05:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:41,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 22:05:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:41,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:05:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:41,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:05:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:41,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:05:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:41,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 22:05:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:41,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:05:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:41,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 22:05:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:41,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 22:05:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:41,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 22:05:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:41,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:05:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:41,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 22:05:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 39 proven. 24 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-07-19 22:05:41,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:41,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082150384] [2022-07-19 22:05:41,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082150384] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:41,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833260336] [2022-07-19 22:05:41,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:41,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:41,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:41,271 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-19 22:05:41,273 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-19 22:05:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:41,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 2867 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-19 22:05:41,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:41,785 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 22:05:41,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-19 22:05:42,161 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-19 22:05:42,222 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-07-19 22:05:42,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2022-07-19 22:05:43,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-19 22:05:43,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:05:43,255 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-19 22:05:43,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-07-19 22:05:43,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-19 22:05:43,369 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-07-19 22:05:43,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-07-19 22:05:43,613 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-19 22:05:43,615 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-19 22:05:43,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-19 22:05:43,638 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_arrayElimArr_1 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_save_byte_from_array_#in~storage#1.base| v_arrayElimArr_1))) (exists ((v_ArrVal_1772 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_1772)))) is different from true [2022-07-19 22:05:43,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-19 22:05:43,659 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-19 22:05:43,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2022-07-19 22:05:43,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-19 22:05:43,718 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-19 22:05:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 171 proven. 18 refuted. 0 times theorem prover too weak. 112 trivial. 2 not checked. [2022-07-19 22:05:43,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:05:44,853 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 22:05:44,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-07-19 22:05:44,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#old_byte_from_lhs~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| 8)) 0))) is different from false [2022-07-19 22:05:44,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833260336] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:44,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:05:44,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28] total 59 [2022-07-19 22:05:44,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074091196] [2022-07-19 22:05:44,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:05:44,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-19 22:05:44,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:44,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-19 22:05:44,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=4428, Unknown=3, NotChecked=270, Total=4970 [2022-07-19 22:05:44,860 INFO L87 Difference]: Start difference. First operand 665 states and 911 transitions. Second operand has 59 states, 52 states have (on average 2.923076923076923) internal successors, (152), 48 states have internal predecessors, (152), 19 states have call successors, (51), 13 states have call predecessors, (51), 16 states have return successors, (48), 18 states have call predecessors, (48), 18 states have call successors, (48) [2022-07-19 22:05:53,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:53,479 INFO L93 Difference]: Finished difference Result 1447 states and 2093 transitions. [2022-07-19 22:05:53,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-07-19 22:05:53,480 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 52 states have (on average 2.923076923076923) internal successors, (152), 48 states have internal predecessors, (152), 19 states have call successors, (51), 13 states have call predecessors, (51), 16 states have return successors, (48), 18 states have call predecessors, (48), 18 states have call successors, (48) Word has length 170 [2022-07-19 22:05:53,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:53,484 INFO L225 Difference]: With dead ends: 1447 [2022-07-19 22:05:53,484 INFO L226 Difference]: Without dead ends: 1079 [2022-07-19 22:05:53,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 272 SyntacticMatches, 9 SemanticMatches, 135 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5350 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1249, Invalid=16815, Unknown=34, NotChecked=534, Total=18632 [2022-07-19 22:05:53,503 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 905 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 8554 mSolverCounterSat, 1039 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 12712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1039 IncrementalHoareTripleChecker+Valid, 8554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3119 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:53,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1743 Invalid, 12712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1039 Valid, 8554 Invalid, 0 Unknown, 3119 Unchecked, 5.6s Time] [2022-07-19 22:05:53,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2022-07-19 22:05:53,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 973. [2022-07-19 22:05:53,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 587 states have (on average 1.1465076660988074) internal successors, (673), 589 states have internal predecessors, (673), 315 states have call successors, (315), 64 states have call predecessors, (315), 70 states have return successors, (422), 319 states have call predecessors, (422), 313 states have call successors, (422) [2022-07-19 22:05:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1410 transitions. [2022-07-19 22:05:53,574 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1410 transitions. Word has length 170 [2022-07-19 22:05:53,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:53,575 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1410 transitions. [2022-07-19 22:05:53,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 52 states have (on average 2.923076923076923) internal successors, (152), 48 states have internal predecessors, (152), 19 states have call successors, (51), 13 states have call predecessors, (51), 16 states have return successors, (48), 18 states have call predecessors, (48), 18 states have call successors, (48) [2022-07-19 22:05:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1410 transitions. [2022-07-19 22:05:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-19 22:05:53,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:53,577 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:53,611 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-19 22:05:53,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:53,799 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:53,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1773315023, now seen corresponding path program 2 times [2022-07-19 22:05:53,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:53,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572704619] [2022-07-19 22:05:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:53,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:05:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:05:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:05:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:05:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:05:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:05:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:05:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:05:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:05:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:05:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 22:05:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:05:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:05:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:05:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 22:05:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:05:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 22:05:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 22:05:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 22:05:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:05:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 22:05:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 36 proven. 11 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-07-19 22:05:54,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:54,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572704619] [2022-07-19 22:05:54,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572704619] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:54,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071111621] [2022-07-19 22:05:54,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 22:05:54,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:54,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:54,238 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-19 22:05:54,239 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-19 22:05:55,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 22:05:55,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:05:55,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 2867 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-19 22:05:55,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:55,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 22:05:55,264 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-19 22:05:55,933 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-19 22:05:55,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-07-19 22:05:55,940 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-19 22:05:55,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-19 22:05:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-19 22:05:56,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:05:56,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071111621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:56,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:05:56,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [15] total 34 [2022-07-19 22:05:56,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930031374] [2022-07-19 22:05:56,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:56,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 22:05:56,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:56,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 22:05:56,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2022-07-19 22:05:56,121 INFO L87 Difference]: Start difference. First operand 973 states and 1410 transitions. Second operand has 21 states, 19 states have (on average 4.105263157894737) internal successors, (78), 16 states have internal predecessors, (78), 7 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2022-07-19 22:05:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:57,404 INFO L93 Difference]: Finished difference Result 1660 states and 2398 transitions. [2022-07-19 22:05:57,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 22:05:57,404 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 4.105263157894737) internal successors, (78), 16 states have internal predecessors, (78), 7 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) Word has length 170 [2022-07-19 22:05:57,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:57,410 INFO L225 Difference]: With dead ends: 1660 [2022-07-19 22:05:57,411 INFO L226 Difference]: Without dead ends: 1492 [2022-07-19 22:05:57,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 192 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=1875, Unknown=0, NotChecked=0, Total=2070 [2022-07-19 22:05:57,412 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 210 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 2749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 679 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:57,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1047 Invalid, 2749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1938 Invalid, 0 Unknown, 679 Unchecked, 1.0s Time] [2022-07-19 22:05:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2022-07-19 22:05:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1476. [2022-07-19 22:05:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 889 states have (on average 1.1496062992125984) internal successors, (1022), 893 states have internal predecessors, (1022), 480 states have call successors, (480), 96 states have call predecessors, (480), 106 states have return successors, (652), 486 states have call predecessors, (652), 476 states have call successors, (652) [2022-07-19 22:05:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 2154 transitions. [2022-07-19 22:05:57,524 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 2154 transitions. Word has length 170 [2022-07-19 22:05:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:57,525 INFO L495 AbstractCegarLoop]: Abstraction has 1476 states and 2154 transitions. [2022-07-19 22:05:57,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 4.105263157894737) internal successors, (78), 16 states have internal predecessors, (78), 7 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2022-07-19 22:05:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 2154 transitions. [2022-07-19 22:05:57,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-19 22:05:57,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:57,529 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:57,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-19 22:05:57,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-19 22:05:57,743 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:57,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash 906081946, now seen corresponding path program 1 times [2022-07-19 22:05:57,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:57,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262490041] [2022-07-19 22:05:57,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:57,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:05:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:05:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:05:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:05:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:05:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:05:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:05:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:05:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:05:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:05:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:05:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 22:05:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:05:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:05:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:05:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:05:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 22:05:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:05:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:05:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 22:05:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:05:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-19 22:05:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-07-19 22:05:58,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:58,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262490041] [2022-07-19 22:05:58,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262490041] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:58,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266895467] [2022-07-19 22:05:58,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:58,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:58,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:58,216 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-19 22:05:58,217 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-19 22:05:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 2859 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-19 22:05:58,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:58,848 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-19 22:05:58,850 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-19 22:05:59,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-19 22:05:59,533 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-19 22:05:59,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:05:59,559 INFO L356 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2022-07-19 22:05:59,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 39 [2022-07-19 22:06:09,940 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 22:06:09,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 29 [2022-07-19 22:06:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 31 proven. 127 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-07-19 22:06:10,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:06:38,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2022-07-19 22:06:38,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2022-07-19 22:06:38,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2022-07-19 22:06:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-07-19 22:06:39,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266895467] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:06:39,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:06:39,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 28, 21] total 63 [2022-07-19 22:06:39,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216482919] [2022-07-19 22:06:39,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:06:39,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-19 22:06:39,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:06:39,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-19 22:06:39,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=3643, Unknown=7, NotChecked=0, Total=3906 [2022-07-19 22:06:39,162 INFO L87 Difference]: Start difference. First operand 1476 states and 2154 transitions. Second operand has 63 states, 53 states have (on average 3.169811320754717) internal successors, (168), 53 states have internal predecessors, (168), 22 states have call successors, (66), 13 states have call predecessors, (66), 17 states have return successors, (63), 15 states have call predecessors, (63), 20 states have call successors, (63) [2022-07-19 22:07:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:07:00,125 INFO L93 Difference]: Finished difference Result 2348 states and 3389 transitions. [2022-07-19 22:07:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-07-19 22:07:00,138 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 53 states have (on average 3.169811320754717) internal successors, (168), 53 states have internal predecessors, (168), 22 states have call successors, (66), 13 states have call predecessors, (66), 17 states have return successors, (63), 15 states have call predecessors, (63), 20 states have call successors, (63) Word has length 172 [2022-07-19 22:07:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:07:00,147 INFO L225 Difference]: With dead ends: 2348 [2022-07-19 22:07:00,147 INFO L226 Difference]: Without dead ends: 2189 [2022-07-19 22:07:00,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 354 SyntacticMatches, 11 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5893 ImplicationChecksByTransitivity, 39.2s TimeCoverageRelationStatistics Valid=1097, Invalid=18075, Unknown=10, NotChecked=0, Total=19182 [2022-07-19 22:07:00,150 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 429 mSDsluCounter, 3913 mSDsCounter, 0 mSdLazyCounter, 5098 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 4142 SdHoareTripleChecker+Invalid, 8290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 5098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2986 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:07:00,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 4142 Invalid, 8290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 5098 Invalid, 0 Unknown, 2986 Unchecked, 3.3s Time] [2022-07-19 22:07:00,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2022-07-19 22:07:00,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2044. [2022-07-19 22:07:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1244 states have (on average 1.1334405144694535) internal successors, (1410), 1256 states have internal predecessors, (1410), 650 states have call successors, (650), 142 states have call predecessors, (650), 149 states have return successors, (900), 645 states have call predecessors, (900), 646 states have call successors, (900) [2022-07-19 22:07:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2960 transitions. [2022-07-19 22:07:00,287 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2960 transitions. Word has length 172 [2022-07-19 22:07:00,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:07:00,288 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 2960 transitions. [2022-07-19 22:07:00,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 53 states have (on average 3.169811320754717) internal successors, (168), 53 states have internal predecessors, (168), 22 states have call successors, (66), 13 states have call predecessors, (66), 17 states have return successors, (63), 15 states have call predecessors, (63), 20 states have call successors, (63) [2022-07-19 22:07:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2960 transitions. [2022-07-19 22:07:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-07-19 22:07:00,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:07:00,293 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:07:00,330 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-19 22:07:00,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:07:00,533 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:07:00,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:07:00,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1555390476, now seen corresponding path program 1 times [2022-07-19 22:07:00,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:07:00,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179839130] [2022-07-19 22:07:00,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:07:00,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:07:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:07:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:07:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:07:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:07:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:07:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:07:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:07:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:07:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:07:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:07:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 22:07:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 22:07:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:07:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:07:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:07:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 22:07:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:07:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:07:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:07:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:07:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:07:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 22:07:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:07:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 22:07:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:07:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 22:07:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-19 22:07:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 22:07:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 22:07:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-19 22:07:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 22:07:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2022-07-19 22:07:00,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:07:00,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179839130] [2022-07-19 22:07:00,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179839130] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:07:00,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252260178] [2022-07-19 22:07:00,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:07:00,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:07:00,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:07:00,940 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-19 22:07:00,942 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-19 22:07:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:01,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 2941 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-19 22:07:01,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:07:01,485 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-19 22:07:01,488 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-19 22:07:01,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 22:07:01,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 22:07:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 299 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-19 22:07:01,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:07:01,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-07-19 22:07:01,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:07:01,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:07:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 25 proven. 21 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-07-19 22:07:02,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252260178] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:07:02,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:07:02,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 25 [2022-07-19 22:07:02,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785943091] [2022-07-19 22:07:02,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:07:02,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-19 22:07:02,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:07:02,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-19 22:07:02,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2022-07-19 22:07:02,011 INFO L87 Difference]: Start difference. First operand 2044 states and 2960 transitions. Second operand has 25 states, 23 states have (on average 5.695652173913044) internal successors, (131), 18 states have internal predecessors, (131), 9 states have call successors, (75), 7 states have call predecessors, (75), 7 states have return successors, (71), 8 states have call predecessors, (71), 8 states have call successors, (71) [2022-07-19 22:07:04,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:07:04,201 INFO L93 Difference]: Finished difference Result 3486 states and 5112 transitions. [2022-07-19 22:07:04,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-19 22:07:04,201 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 5.695652173913044) internal successors, (131), 18 states have internal predecessors, (131), 9 states have call successors, (75), 7 states have call predecessors, (75), 7 states have return successors, (71), 8 states have call predecessors, (71), 8 states have call successors, (71) Word has length 204 [2022-07-19 22:07:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:07:04,210 INFO L225 Difference]: With dead ends: 3486 [2022-07-19 22:07:04,211 INFO L226 Difference]: Without dead ends: 2095 [2022-07-19 22:07:04,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 449 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=1839, Unknown=0, NotChecked=0, Total=2070 [2022-07-19 22:07:04,217 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 178 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 3304 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 3697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 3304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-19 22:07:04,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1150 Invalid, 3697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 3304 Invalid, 0 Unknown, 289 Unchecked, 1.6s Time] [2022-07-19 22:07:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2022-07-19 22:07:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 1787. [2022-07-19 22:07:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1108 states have (on average 1.114620938628159) internal successors, (1235), 1118 states have internal predecessors, (1235), 535 states have call successors, (535), 138 states have call predecessors, (535), 143 states have return successors, (730), 530 states have call predecessors, (730), 531 states have call successors, (730) [2022-07-19 22:07:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2500 transitions. [2022-07-19 22:07:04,348 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2500 transitions. Word has length 204 [2022-07-19 22:07:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:07:04,348 INFO L495 AbstractCegarLoop]: Abstraction has 1787 states and 2500 transitions. [2022-07-19 22:07:04,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 5.695652173913044) internal successors, (131), 18 states have internal predecessors, (131), 9 states have call successors, (75), 7 states have call predecessors, (75), 7 states have return successors, (71), 8 states have call predecessors, (71), 8 states have call successors, (71) [2022-07-19 22:07:04,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2500 transitions. [2022-07-19 22:07:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-19 22:07:04,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:07:04,353 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:07:04,391 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-19 22:07:04,574 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-19 22:07:04,574 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:07:04,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:07:04,574 INFO L85 PathProgramCache]: Analyzing trace with hash -431353651, now seen corresponding path program 1 times [2022-07-19 22:07:04,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:07:04,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005374745] [2022-07-19 22:07:04,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:07:04,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:07:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:07:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:07:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:07:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:07:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:07:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:07:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:07:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:07:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:07:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:07:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:07:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:07:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:07:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:07:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:07:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:07:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:07:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:07:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 22:07:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 22:07:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 22:07:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 22:07:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 22:07:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 22:07:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-19 22:07:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 36 proven. 11 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2022-07-19 22:07:04,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:07:04,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005374745] [2022-07-19 22:07:04,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005374745] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:07:04,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242727825] [2022-07-19 22:07:04,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:07:04,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:07:04,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:07:04,946 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-19 22:07:04,948 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-19 22:07:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:07:05,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 2910 conjuncts, 157 conjunts are in the unsatisfiable core [2022-07-19 22:07:05,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:07:05,468 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 22:07:05,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-19 22:07:05,697 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-19 22:07:05,732 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-19 22:07:05,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2022-07-19 22:07:06,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2022-07-19 22:07:06,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 22:07:06,242 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 6 treesize of output 5 [2022-07-19 22:07:06,281 INFO L356 Elim1Store]: treesize reduction 88, result has 20.0 percent of original size [2022-07-19 22:07:06,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2022-07-19 22:07:06,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-19 22:07:07,423 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 11 treesize of output 7 [2022-07-19 22:07:07,439 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-19 22:07:09,463 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2337 (Array Int Int)) (|save_byte_from_array_~storage#1.base| Int) (aux_div_v_ArrVal_2335_40 Int) (aux_mod_v_ArrVal_2335_40 Int) (v_ArrVal_2338 Int)) (and (= (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| (store (store (select |c_old(#memory_int)| |save_byte_from_array_~storage#1.base|) |c_save_byte_from_array_#in~storage#1.offset| (+ (* 18446744073709551616 aux_div_v_ArrVal_2335_40) aux_mod_v_ArrVal_2335_40)) (+ |c_save_byte_from_array_#in~storage#1.offset| 8) v_ArrVal_2338)) |c_#memory_int|) (<= 0 aux_mod_v_ArrVal_2335_40) (< aux_mod_v_ArrVal_2335_40 (mod |c_save_byte_from_array_#in~size#1| 18446744073709551616)) (= (store |c_old(#memory_$Pointer$.base)| |save_byte_from_array_~storage#1.base| v_ArrVal_2337) |c_#memory_$Pointer$.base|))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base_BEFORE_CALL_95| Int) (|v_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base_BEFORE_CALL_71| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base_BEFORE_CALL_71|) 1) (= (select |c_#valid| |v_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base_BEFORE_CALL_95|) 1) (not (= |v_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base_BEFORE_CALL_71| |v_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base_BEFORE_CALL_95|))))) is different from true [2022-07-19 22:07:09,499 INFO L356 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2022-07-19 22:07:09,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 35 [2022-07-19 22:07:09,514 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 22:07:09,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-07-19 22:07:09,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-19 22:07:09,978 INFO L356 Elim1Store]: treesize reduction 8, result has 86.4 percent of original size [2022-07-19 22:07:09,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 175 [2022-07-19 22:07:10,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-19 22:07:10,400 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 22:07:10,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2022-07-19 22:07:10,402 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 22:07:10,404 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 22:07:10,524 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-19 22:07:10,525 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-19 22:07:10,534 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2341 (Array Int Int))) (= (store |c_old(#memory_int)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_2341) |c_#memory_int|)) (exists ((v_ArrVal_2342 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_2342) |c_#memory_$Pointer$.base|))) is different from true [2022-07-19 22:07:10,553 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 129 treesize of output 129 [2022-07-19 22:07:10,576 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 22:07:10,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 133 [2022-07-19 22:07:10,584 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 22:07:10,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-19 22:07:10,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:07:10,800 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:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) 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:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) 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-19 22:07:10,803 INFO L158 Benchmark]: Toolchain (without parser) took 220232.82ms. Allocated memory was 86.0MB in the beginning and 564.1MB in the end (delta: 478.2MB). Free memory was 45.3MB in the beginning and 194.8MB in the end (delta: -149.5MB). Peak memory consumption was 327.8MB. Max. memory is 16.1GB. [2022-07-19 22:07:10,803 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory is still 42.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:07:10,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1680.72ms. Allocated memory was 86.0MB in the beginning and 134.2MB in the end (delta: 48.2MB). Free memory was 45.1MB in the beginning and 61.9MB in the end (delta: -16.8MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2022-07-19 22:07:10,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 154.93ms. Allocated memory is still 134.2MB. Free memory was 61.9MB in the beginning and 80.3MB in the end (delta: -18.4MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2022-07-19 22:07:10,804 INFO L158 Benchmark]: Boogie Preprocessor took 87.94ms. Allocated memory is still 134.2MB. Free memory was 80.3MB in the beginning and 73.3MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 22:07:10,804 INFO L158 Benchmark]: RCFGBuilder took 1173.32ms. Allocated memory was 134.2MB in the beginning and 172.0MB in the end (delta: 37.7MB). Free memory was 73.3MB in the beginning and 89.5MB in the end (delta: -16.2MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2022-07-19 22:07:10,804 INFO L158 Benchmark]: TraceAbstraction took 217130.08ms. Allocated memory was 172.0MB in the beginning and 564.1MB in the end (delta: 392.2MB). Free memory was 88.5MB in the beginning and 194.8MB in the end (delta: -106.3MB). Peak memory consumption was 284.9MB. Max. memory is 16.1GB. [2022-07-19 22:07:10,805 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.15ms. Allocated memory is still 86.0MB. Free memory is still 42.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1680.72ms. Allocated memory was 86.0MB in the beginning and 134.2MB in the end (delta: 48.2MB). Free memory was 45.1MB in the beginning and 61.9MB in the end (delta: -16.8MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 154.93ms. Allocated memory is still 134.2MB. Free memory was 61.9MB in the beginning and 80.3MB in the end (delta: -18.4MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.94ms. Allocated memory is still 134.2MB. Free memory was 80.3MB in the beginning and 73.3MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1173.32ms. Allocated memory was 134.2MB in the beginning and 172.0MB in the end (delta: 37.7MB). Free memory was 73.3MB in the beginning and 89.5MB in the end (delta: -16.2MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * TraceAbstraction took 217130.08ms. Allocated memory was 172.0MB in the beginning and 564.1MB in the end (delta: 392.2MB). Free memory was 88.5MB in the beginning and 194.8MB in the end (delta: -106.3MB). Peak memory consumption was 284.9MB. 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-19 22:07:10,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_compare_lexical_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 60926facf5511174d61dcd6a0b7a731efc9ccdb495bc26b58400da4cd6320ca0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:07:12,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:07:12,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:07:12,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:07:12,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:07:12,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:07:12,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:07:12,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:07:12,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:07:12,562 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:07:12,563 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:07:12,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:07:12,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:07:12,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:07:12,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:07:12,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:07:12,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:07:12,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:07:12,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:07:12,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:07:12,581 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:07:12,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:07:12,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:07:12,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:07:12,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:07:12,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:07:12,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:07:12,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:07:12,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:07:12,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:07:12,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:07:12,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:07:12,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:07:12,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:07:12,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:07:12,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:07:12,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:07:12,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:07:12,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:07:12,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:07:12,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:07:12,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:07:12,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-19 22:07:12,638 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:07:12,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:07:12,638 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:07:12,639 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:07:12,639 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:07:12,639 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:07:12,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:07:12,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:07:12,640 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:07:12,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:07:12,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:07:12,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:07:12,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:07:12,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:07:12,642 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 22:07:12,642 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 22:07:12,642 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 22:07:12,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:07:12,642 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:07:12,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:07:12,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:07:12,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:07:12,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:07:12,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:07:12,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:07:12,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:07:12,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:07:12,644 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 22:07:12,644 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 22:07:12,644 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:07:12,644 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:07:12,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:07:12,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 22:07:12,645 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 -> 60926facf5511174d61dcd6a0b7a731efc9ccdb495bc26b58400da4cd6320ca0 [2022-07-19 22:07:12,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:07:12,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:07:12,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:07:12,935 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:07:12,936 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:07:12,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i [2022-07-19 22:07:12,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf431dd08/f11a1ae42bae41a5822f40ecec30e01e/FLAGc3f20e91e [2022-07-19 22:07:13,543 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:07:13,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i [2022-07-19 22:07:13,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf431dd08/f11a1ae42bae41a5822f40ecec30e01e/FLAGc3f20e91e [2022-07-19 22:07:13,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf431dd08/f11a1ae42bae41a5822f40ecec30e01e [2022-07-19 22:07:13,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:07:13,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:07:13,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:07:13,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:07:13,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:07:13,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:07:13" (1/1) ... [2022-07-19 22:07:13,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d2b7627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:07:13, skipping insertion in model container [2022-07-19 22:07:13,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:07:13" (1/1) ... [2022-07-19 22:07:13,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:07:13,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:07:14,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i[4505,4518] [2022-07-19 22:07:14,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lexical_harness.i[4565,4578] [2022-07-19 22:07:14,521 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:07:14,526 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:07:14,528 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:07:14,530 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:07:14,539 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:07:14,555 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:07:14,557 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:07:14,559 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:07:14,559 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:07:14,774 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:07:14,775 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:07:14,776 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:07:14,776 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:07:14,777 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:07:14,777 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:07:14,778 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:07:14,778 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:07:14,779 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:07:14,779 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:07:14,876 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:07:14,889 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-19 22:07:14,899 INFO L158 Benchmark]: Toolchain (without parser) took 1170.14ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 30.0MB in the beginning and 48.8MB in the end (delta: -18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 22:07:14,900 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 60.8MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:07:14,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1167.44ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 29.8MB in the beginning and 48.8MB in the end (delta: -19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 22:07:14,903 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.20ms. Allocated memory is still 60.8MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1167.44ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 29.8MB in the beginning and 48.8MB in the end (delta: -19.0MB). Peak memory consumption was 16.8MB. 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