./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_read_be32_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_read_be32_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 065f95e1f01b1c2bb5cc332c26e118823e72d0e75cb3966f20aacf6dc1740b4a --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:03:30,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:03:30,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:03:30,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:03:30,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:03:30,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:03:30,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:03:30,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:03:30,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:03:30,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:03:30,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:03:30,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:03:30,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:03:30,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:03:30,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:03:30,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:03:30,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:03:30,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:03:30,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:03:30,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:03:30,392 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:03:30,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:03:30,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:03:30,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:03:30,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:03:30,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:03:30,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:03:30,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:03:30,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:03:30,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:03:30,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:03:30,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:03:30,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:03:30,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:03:30,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:03:30,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:03:30,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:03:30,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:03:30,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:03:30,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:03:30,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:03:30,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:03:30,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:03:30,445 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:03:30,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:03:30,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:03:30,448 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:03:30,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:03:30,449 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:03:30,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:03:30,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:03:30,450 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:03:30,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:03:30,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:03:30,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:03:30,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:03:30,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:03:30,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:03:30,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:03:30,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:03:30,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:03:30,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:03:30,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:03:30,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:03:30,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:03:30,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:03:30,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:03:30,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:03:30,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:03:30,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:03:30,456 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:03:30,456 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:03:30,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:03:30,457 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 -> 065f95e1f01b1c2bb5cc332c26e118823e72d0e75cb3966f20aacf6dc1740b4a [2022-07-12 11:03:30,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:03:30,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:03:30,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:03:30,679 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:03:30,680 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:03:30,682 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_read_be32_harness.i [2022-07-12 11:03:30,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f679994eb/852fbe9676a0436d9a0f06c32b81dd20/FLAGb37c92c19 [2022-07-12 11:03:31,497 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:03:31,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_read_be32_harness.i [2022-07-12 11:03:31,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f679994eb/852fbe9676a0436d9a0f06c32b81dd20/FLAGb37c92c19 [2022-07-12 11:03:31,724 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f679994eb/852fbe9676a0436d9a0f06c32b81dd20 [2022-07-12 11:03:31,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:03:31,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:03:31,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:03:31,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:03:31,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:03:31,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:03:31" (1/1) ... [2022-07-12 11:03:31,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce04a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:03:31, skipping insertion in model container [2022-07-12 11:03:31,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:03:31" (1/1) ... [2022-07-12 11:03:31,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:03:31,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:03:32,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_read_be32_harness.i[4499,4512] [2022-07-12 11:03:32,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_read_be32_harness.i[4559,4572] [2022-07-12 11:03:32,817 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:32,818 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:32,818 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:32,819 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:32,820 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:32,830 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:32,831 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:32,832 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:32,833 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:33,139 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:03:33,140 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:03:33,141 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:03:33,142 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:03:33,143 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:03:33,144 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:03:33,144 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:03:33,146 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:03:33,146 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:03:33,148 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:03:33,295 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:03:33,370 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:33,371 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:33,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:03:33,496 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:03:33,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_read_be32_harness.i[4499,4512] [2022-07-12 11:03:33,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_read_be32_harness.i[4559,4572] [2022-07-12 11:03:33,556 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:33,559 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:33,561 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:33,564 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:33,565 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:33,579 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:33,582 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:33,585 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:33,586 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:33,629 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:03:33,631 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:03:33,632 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:03:33,632 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:03:33,635 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:03:33,636 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:03:33,637 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:03:33,637 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:03:33,637 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:03:33,638 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:03:33,667 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:03:33,712 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:33,712 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:33,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:03:33,988 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:03:33,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:03:33 WrapperNode [2022-07-12 11:03:33,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:03:33,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:03:33,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:03:33,990 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:03:33,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:03:33" (1/1) ... [2022-07-12 11:03:34,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:03:33" (1/1) ... [2022-07-12 11:03:34,193 INFO L137 Inliner]: procedures = 691, calls = 2645, calls flagged for inlining = 62, calls inlined = 11, statements flattened = 986 [2022-07-12 11:03:34,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:03:34,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:03:34,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:03:34,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:03:34,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:03:33" (1/1) ... [2022-07-12 11:03:34,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:03:33" (1/1) ... [2022-07-12 11:03:34,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:03:33" (1/1) ... [2022-07-12 11:03:34,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:03:33" (1/1) ... [2022-07-12 11:03:34,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:03:33" (1/1) ... [2022-07-12 11:03:34,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:03:33" (1/1) ... [2022-07-12 11:03:34,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:03:33" (1/1) ... [2022-07-12 11:03:34,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:03:34,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:03:34,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:03:34,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:03:34,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:03:33" (1/1) ... [2022-07-12 11:03:34,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:03:34,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:34,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 11:03:34,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 11:03:34,395 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_read [2022-07-12 11:03:34,396 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_read [2022-07-12 11:03:34,396 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-12 11:03:34,396 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-12 11:03:34,396 INFO L130 BoogieDeclarations]: Found specification of procedure ntohl [2022-07-12 11:03:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:03:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 11:03:34,397 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 11:03:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-07-12 11:03:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 11:03:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 11:03:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:03:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 11:03:34,399 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 11:03:34,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:03:34,400 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:03:34,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:03:34,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:03:34,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:03:34,401 INFO L130 BoogieDeclarations]: Found specification of procedure aws_ntoh32 [2022-07-12 11:03:34,401 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_ntoh32 [2022-07-12 11:03:34,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:03:34,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:03:34,401 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 11:03:34,401 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 11:03:34,402 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-12 11:03:34,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-12 11:03:34,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 11:03:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 11:03:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-07-12 11:03:34,403 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-07-12 11:03:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:03:34,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:03:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:03:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:03:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:03:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 11:03:34,405 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 11:03:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:03:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-07-12 11:03:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:03:34,671 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:03:34,673 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:03:35,954 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:03:35,963 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:03:35,963 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 11:03:35,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:03:35 BoogieIcfgContainer [2022-07-12 11:03:35,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:03:35,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:03:35,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:03:35,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:03:35,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:03:31" (1/3) ... [2022-07-12 11:03:35,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4568aecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:03:35, skipping insertion in model container [2022-07-12 11:03:35,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:03:33" (2/3) ... [2022-07-12 11:03:35,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4568aecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:03:35, skipping insertion in model container [2022-07-12 11:03:35,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:03:35" (3/3) ... [2022-07-12 11:03:35,976 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_read_be32_harness.i [2022-07-12 11:03:35,989 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:03:35,989 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:03:36,061 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:03:36,071 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@1b0c4263, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2687f875 [2022-07-12 11:03:36,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:03:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 103 states have internal predecessors, (128), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-07-12 11:03:36,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 11:03:36,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:36,092 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:36,093 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:36,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash -89191240, now seen corresponding path program 1 times [2022-07-12 11:03:36,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:36,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745552813] [2022-07-12 11:03:36,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:36,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:03:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:03:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 11:03:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 11:03:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:03:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:03:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:03:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:03:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:03:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:03:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:03:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:03:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:03:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:03:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:03:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:03:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-07-12 11:03:36,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:36,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745552813] [2022-07-12 11:03:36,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745552813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:36,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:03:36,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:03:36,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500226462] [2022-07-12 11:03:36,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:36,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:03:36,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:36,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:03:36,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:03:36,971 INFO L87 Difference]: Start difference. First operand has 163 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 103 states have internal predecessors, (128), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 11:03:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:37,624 INFO L93 Difference]: Finished difference Result 326 states and 478 transitions. [2022-07-12 11:03:37,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:03:37,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2022-07-12 11:03:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:37,636 INFO L225 Difference]: With dead ends: 326 [2022-07-12 11:03:37,636 INFO L226 Difference]: Without dead ends: 164 [2022-07-12 11:03:37,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:03:37,644 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 117 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:37,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 290 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 11:03:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-12 11:03:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 157. [2022-07-12 11:03:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 97 states have (on average 1.2371134020618557) internal successors, (120), 98 states have internal predecessors, (120), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-07-12 11:03:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 215 transitions. [2022-07-12 11:03:37,695 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 215 transitions. Word has length 124 [2022-07-12 11:03:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:37,695 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 215 transitions. [2022-07-12 11:03:37,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 11:03:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 215 transitions. [2022-07-12 11:03:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 11:03:37,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:37,699 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:37,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:03:37,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:37,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:37,700 INFO L85 PathProgramCache]: Analyzing trace with hash -296495566, now seen corresponding path program 1 times [2022-07-12 11:03:37,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:37,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979583926] [2022-07-12 11:03:37,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:37,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:37,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:37,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:37,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:03:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:37,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:37,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:03:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:37,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 11:03:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:37,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 11:03:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:37,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:03:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:38,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:03:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:38,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:03:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:38,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:03:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:38,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:03:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:38,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:03:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:38,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:03:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:38,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:03:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:03:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:38,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:03:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:38,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:03:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:38,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:03:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-12 11:03:38,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:38,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979583926] [2022-07-12 11:03:38,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979583926] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:38,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458880795] [2022-07-12 11:03:38,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:38,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:38,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:38,098 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:38,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 11:03:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:38,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 2744 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 11:03:38,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-07-12 11:03:38,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:03:38,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458880795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:38,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:03:38,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-12 11:03:38,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437624931] [2022-07-12 11:03:38,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:38,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:03:38,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:38,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:03:38,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:03:38,826 INFO L87 Difference]: Start difference. First operand 157 states and 215 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 11:03:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:39,078 INFO L93 Difference]: Finished difference Result 290 states and 409 transitions. [2022-07-12 11:03:39,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:03:39,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 124 [2022-07-12 11:03:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:39,085 INFO L225 Difference]: With dead ends: 290 [2022-07-12 11:03:39,085 INFO L226 Difference]: Without dead ends: 160 [2022-07-12 11:03:39,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:03:39,092 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 238 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:39,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 450 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:03:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-12 11:03:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-07-12 11:03:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 101 states have internal predecessors, (122), 48 states have call successors, (48), 11 states have call predecessors, (48), 12 states have return successors, (55), 47 states have call predecessors, (55), 47 states have call successors, (55) [2022-07-12 11:03:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 225 transitions. [2022-07-12 11:03:39,133 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 225 transitions. Word has length 124 [2022-07-12 11:03:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:39,135 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 225 transitions. [2022-07-12 11:03:39,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 11:03:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 225 transitions. [2022-07-12 11:03:39,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 11:03:39,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:39,144 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:39,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:39,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:39,377 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:39,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:39,377 INFO L85 PathProgramCache]: Analyzing trace with hash -961099817, now seen corresponding path program 1 times [2022-07-12 11:03:39,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:39,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680766365] [2022-07-12 11:03:39,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:39,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:03:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:03:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:03:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:03:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:03:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:03:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:03:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:03:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:03:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:03:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:03:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:03:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:03:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:03:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:03:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:03:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-12 11:03:39,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:39,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680766365] [2022-07-12 11:03:39,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680766365] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:39,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353028821] [2022-07-12 11:03:39,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:39,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:39,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:39,813 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:39,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 11:03:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 2749 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:03:40,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-07-12 11:03:40,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:03:40,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353028821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:40,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:03:40,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-12 11:03:40,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871237903] [2022-07-12 11:03:40,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:40,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:03:40,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:40,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:03:40,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:03:40,428 INFO L87 Difference]: Start difference. First operand 160 states and 225 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-12 11:03:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:40,729 INFO L93 Difference]: Finished difference Result 276 states and 390 transitions. [2022-07-12 11:03:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:03:40,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 4 states have call successors, (21), 2 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 126 [2022-07-12 11:03:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:40,737 INFO L225 Difference]: With dead ends: 276 [2022-07-12 11:03:40,737 INFO L226 Difference]: Without dead ends: 160 [2022-07-12 11:03:40,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:03:40,739 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 256 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:40,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 587 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:03:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-12 11:03:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-07-12 11:03:40,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 101 states have internal predecessors, (122), 48 states have call successors, (48), 11 states have call predecessors, (48), 12 states have return successors, (53), 47 states have call predecessors, (53), 47 states have call successors, (53) [2022-07-12 11:03:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 223 transitions. [2022-07-12 11:03:40,764 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 223 transitions. Word has length 126 [2022-07-12 11:03:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:40,768 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 223 transitions. [2022-07-12 11:03:40,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-12 11:03:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 223 transitions. [2022-07-12 11:03:40,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-12 11:03:40,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:40,772 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:40,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 11:03:40,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-12 11:03:40,988 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:40,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1396549486, now seen corresponding path program 2 times [2022-07-12 11:03:40,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:40,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942024675] [2022-07-12 11:03:40,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:40,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:03:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:03:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:03:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:03:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:03:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:03:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:03:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:03:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:03:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:03:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:03:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:03:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:03:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:03:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:03:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 11:03:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-12 11:03:41,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:41,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942024675] [2022-07-12 11:03:41,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942024675] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:41,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794420206] [2022-07-12 11:03:41,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:03:41,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:41,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:41,403 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:41,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 11:03:42,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:03:42,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:03:42,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 2754 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 11:03:42,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-07-12 11:03:42,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:03:42,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794420206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:42,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:03:42,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2022-07-12 11:03:42,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093477784] [2022-07-12 11:03:42,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:42,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:03:42,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:42,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:03:42,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:03:42,429 INFO L87 Difference]: Start difference. First operand 160 states and 223 transitions. Second operand has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 5 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 5 states have call successors, (19) [2022-07-12 11:03:42,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:42,663 INFO L93 Difference]: Finished difference Result 270 states and 377 transitions. [2022-07-12 11:03:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:03:42,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 5 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 5 states have call successors, (19) Word has length 128 [2022-07-12 11:03:42,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:42,666 INFO L225 Difference]: With dead ends: 270 [2022-07-12 11:03:42,666 INFO L226 Difference]: Without dead ends: 160 [2022-07-12 11:03:42,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:03:42,667 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 121 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:42,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1149 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:03:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-12 11:03:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-07-12 11:03:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 101 states have internal predecessors, (122), 48 states have call successors, (48), 11 states have call predecessors, (48), 12 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2022-07-12 11:03:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 220 transitions. [2022-07-12 11:03:42,691 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 220 transitions. Word has length 128 [2022-07-12 11:03:42,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:42,692 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 220 transitions. [2022-07-12 11:03:42,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 5 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 5 states have call successors, (19) [2022-07-12 11:03:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 220 transitions. [2022-07-12 11:03:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 11:03:42,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:42,694 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:42,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 11:03:42,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:42,895 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:42,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash 898615479, now seen corresponding path program 3 times [2022-07-12 11:03:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:42,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919130604] [2022-07-12 11:03:42,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:42,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:03:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:03:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:03:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:03:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:03:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:03:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:03:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:03:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:03:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:03:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:03:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:03:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:03:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:03:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:03:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:03:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,354 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-07-12 11:03:43,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:43,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919130604] [2022-07-12 11:03:43,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919130604] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:43,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214812310] [2022-07-12 11:03:43,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 11:03:43,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:43,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:43,360 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:43,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 11:03:44,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-12 11:03:44,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:03:44,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 2408 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 11:03:44,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-12 11:03:44,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:03:44,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214812310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:44,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:03:44,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-12 11:03:44,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362506911] [2022-07-12 11:03:44,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:44,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:03:44,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:44,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:03:44,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:03:44,559 INFO L87 Difference]: Start difference. First operand 160 states and 220 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 11:03:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:44,699 INFO L93 Difference]: Finished difference Result 265 states and 363 transitions. [2022-07-12 11:03:44,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:03:44,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 130 [2022-07-12 11:03:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:44,702 INFO L225 Difference]: With dead ends: 265 [2022-07-12 11:03:44,702 INFO L226 Difference]: Without dead ends: 160 [2022-07-12 11:03:44,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:03:44,704 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 2 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:44,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1166 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:03:44,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-12 11:03:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-07-12 11:03:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 101 states have internal predecessors, (122), 48 states have call successors, (48), 11 states have call predecessors, (48), 12 states have return successors, (49), 47 states have call predecessors, (49), 47 states have call successors, (49) [2022-07-12 11:03:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 219 transitions. [2022-07-12 11:03:44,717 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 219 transitions. Word has length 130 [2022-07-12 11:03:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:44,717 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 219 transitions. [2022-07-12 11:03:44,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 11:03:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 219 transitions. [2022-07-12 11:03:44,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 11:03:44,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:44,719 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 4, 4, 4, 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] [2022-07-12 11:03:44,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:44,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:44,935 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:44,935 INFO L85 PathProgramCache]: Analyzing trace with hash -657945444, now seen corresponding path program 4 times [2022-07-12 11:03:44,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:44,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972540337] [2022-07-12 11:03:44,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:44,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:03:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:03:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:03:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:03:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:03:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:03:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:03:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:03:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:03:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:03:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:03:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:03:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:03:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:03:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:03:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:03:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2022-07-12 11:03:45,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:45,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972540337] [2022-07-12 11:03:45,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972540337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:45,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:03:45,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 11:03:45,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086676582] [2022-07-12 11:03:45,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:45,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:03:45,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:45,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:03:45,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:03:45,312 INFO L87 Difference]: Start difference. First operand 160 states and 219 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 8 states have internal predecessors, (48), 6 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (19), 6 states have call predecessors, (19), 5 states have call successors, (19) [2022-07-12 11:03:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:46,553 INFO L93 Difference]: Finished difference Result 261 states and 353 transitions. [2022-07-12 11:03:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 11:03:46,559 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 8 states have internal predecessors, (48), 6 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (19), 6 states have call predecessors, (19), 5 states have call successors, (19) Word has length 132 [2022-07-12 11:03:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:46,563 INFO L225 Difference]: With dead ends: 261 [2022-07-12 11:03:46,563 INFO L226 Difference]: Without dead ends: 167 [2022-07-12 11:03:46,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-12 11:03:46,564 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 255 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:46,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 662 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 11:03:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-12 11:03:46,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2022-07-12 11:03:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 101 states have internal predecessors, (122), 48 states have call successors, (48), 11 states have call predecessors, (48), 12 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2022-07-12 11:03:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 218 transitions. [2022-07-12 11:03:46,577 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 218 transitions. Word has length 132 [2022-07-12 11:03:46,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:46,577 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 218 transitions. [2022-07-12 11:03:46,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 8 states have internal predecessors, (48), 6 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (19), 6 states have call predecessors, (19), 5 states have call successors, (19) [2022-07-12 11:03:46,578 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 218 transitions. [2022-07-12 11:03:46,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 11:03:46,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:46,579 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:46,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 11:03:46,580 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:46,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:46,580 INFO L85 PathProgramCache]: Analyzing trace with hash -590506687, now seen corresponding path program 1 times [2022-07-12 11:03:46,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:46,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151611324] [2022-07-12 11:03:46,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:46,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:46,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:46,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:46,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:03:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:46,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:46,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:03:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:46,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:03:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:46,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:03:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:46,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:03:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:46,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:03:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:46,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:03:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:46,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:03:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:46,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:03:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:46,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:03:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:03:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:47,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:03:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:47,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:03:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:47,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:03:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:47,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:03:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:47,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:03:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2022-07-12 11:03:47,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:47,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151611324] [2022-07-12 11:03:47,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151611324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:47,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:03:47,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:03:47,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898163652] [2022-07-12 11:03:47,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:47,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:03:47,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:47,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:03:47,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:03:47,078 INFO L87 Difference]: Start difference. First operand 160 states and 218 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 11:03:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:48,283 INFO L93 Difference]: Finished difference Result 179 states and 249 transitions. [2022-07-12 11:03:48,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 11:03:48,283 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (21), 4 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 134 [2022-07-12 11:03:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:48,285 INFO L225 Difference]: With dead ends: 179 [2022-07-12 11:03:48,285 INFO L226 Difference]: Without dead ends: 177 [2022-07-12 11:03:48,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:03:48,286 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 139 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:48,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 903 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 11:03:48,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-12 11:03:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 169. [2022-07-12 11:03:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 105 states have (on average 1.2190476190476192) internal successors, (128), 108 states have internal predecessors, (128), 49 states have call successors, (49), 12 states have call predecessors, (49), 14 states have return successors, (59), 48 states have call predecessors, (59), 48 states have call successors, (59) [2022-07-12 11:03:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 236 transitions. [2022-07-12 11:03:48,301 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 236 transitions. Word has length 134 [2022-07-12 11:03:48,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:48,301 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 236 transitions. [2022-07-12 11:03:48,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 11:03:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 236 transitions. [2022-07-12 11:03:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 11:03:48,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:48,303 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 4, 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] [2022-07-12 11:03:48,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 11:03:48,304 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:48,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:48,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1856338057, now seen corresponding path program 1 times [2022-07-12 11:03:48,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:48,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124039996] [2022-07-12 11:03:48,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:48,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:03:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:03:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:03:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:03:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:03:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:03:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:03:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:03:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:03:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:03:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:03:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:03:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:03:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:03:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:03:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:03:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-12 11:03:48,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:48,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124039996] [2022-07-12 11:03:48,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124039996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:48,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:03:48,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:03:48,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567236063] [2022-07-12 11:03:48,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:48,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:03:48,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:48,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:03:48,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:03:48,706 INFO L87 Difference]: Start difference. First operand 169 states and 236 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 11:03:49,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:49,503 INFO L93 Difference]: Finished difference Result 308 states and 433 transitions. [2022-07-12 11:03:49,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:03:49,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 138 [2022-07-12 11:03:49,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:49,505 INFO L225 Difference]: With dead ends: 308 [2022-07-12 11:03:49,505 INFO L226 Difference]: Without dead ends: 179 [2022-07-12 11:03:49,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:03:49,506 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 124 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:49,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 486 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 11:03:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-12 11:03:49,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 173. [2022-07-12 11:03:49,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 112 states have internal predecessors, (133), 49 states have call successors, (49), 12 states have call predecessors, (49), 15 states have return successors, (60), 48 states have call predecessors, (60), 48 states have call successors, (60) [2022-07-12 11:03:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 242 transitions. [2022-07-12 11:03:49,520 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 242 transitions. Word has length 138 [2022-07-12 11:03:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:49,521 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 242 transitions. [2022-07-12 11:03:49,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 11:03:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 242 transitions. [2022-07-12 11:03:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-12 11:03:49,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:49,523 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 4, 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] [2022-07-12 11:03:49,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 11:03:49,523 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:49,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:49,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1607088108, now seen corresponding path program 1 times [2022-07-12 11:03:49,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:49,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523659139] [2022-07-12 11:03:49,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:49,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:03:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:03:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:03:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:03:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:03:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:03:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:03:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:03:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:03:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:03:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:03:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:03:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:03:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:03:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:03:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:03:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2022-07-12 11:03:50,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:50,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523659139] [2022-07-12 11:03:50,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523659139] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:50,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951333585] [2022-07-12 11:03:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:50,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:50,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:50,035 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:50,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 11:03:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 2912 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 11:03:50,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:50,612 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-12 11:03:50,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:03:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-12 11:03:50,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951333585] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:50,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:03:50,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13, 5] total 17 [2022-07-12 11:03:50,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175104994] [2022-07-12 11:03:50,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:50,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:03:50,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:50,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:03:50,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:03:50,704 INFO L87 Difference]: Start difference. First operand 173 states and 242 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 11:03:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:50,814 INFO L93 Difference]: Finished difference Result 313 states and 444 transitions. [2022-07-12 11:03:50,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:03:50,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 139 [2022-07-12 11:03:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:50,816 INFO L225 Difference]: With dead ends: 313 [2022-07-12 11:03:50,816 INFO L226 Difference]: Without dead ends: 179 [2022-07-12 11:03:50,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:03:50,818 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 5 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:50,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 420 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:03:50,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-12 11:03:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2022-07-12 11:03:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 114 states have internal predecessors, (136), 49 states have call successors, (49), 13 states have call predecessors, (49), 15 states have return successors, (60), 48 states have call predecessors, (60), 48 states have call successors, (60) [2022-07-12 11:03:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 245 transitions. [2022-07-12 11:03:50,831 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 245 transitions. Word has length 139 [2022-07-12 11:03:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:50,832 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 245 transitions. [2022-07-12 11:03:50,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 11:03:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 245 transitions. [2022-07-12 11:03:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-12 11:03:50,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:50,834 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:50,865 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-12 11:03:51,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:51,056 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:51,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1054111573, now seen corresponding path program 1 times [2022-07-12 11:03:51,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:51,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788777674] [2022-07-12 11:03:51,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:51,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:03:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:03:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:03:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:03:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:03:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:03:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:03:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:03:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:03:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:03:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:03:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:03:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:03:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:03:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:03:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:03:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-07-12 11:03:51,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:51,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788777674] [2022-07-12 11:03:51,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788777674] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:51,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610816247] [2022-07-12 11:03:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:51,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:51,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:51,555 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:51,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 11:03:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:52,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 2935 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 11:03:52,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:52,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 11:03:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 84 proven. 4 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-12 11:03:52,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:03:52,884 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:03:52,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2022-07-12 11:03:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-07-12 11:03:52,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610816247] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:03:52,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:03:52,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 29 [2022-07-12 11:03:52,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529793180] [2022-07-12 11:03:52,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:03:52,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 11:03:52,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:52,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 11:03:52,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2022-07-12 11:03:52,903 INFO L87 Difference]: Start difference. First operand 176 states and 245 transitions. Second operand has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 21 states have internal predecessors, (121), 11 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (53), 10 states have call predecessors, (53), 10 states have call successors, (53) [2022-07-12 11:03:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:56,001 INFO L93 Difference]: Finished difference Result 352 states and 493 transitions. [2022-07-12 11:03:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 11:03:56,002 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 21 states have internal predecessors, (121), 11 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (53), 10 states have call predecessors, (53), 10 states have call successors, (53) Word has length 140 [2022-07-12 11:03:56,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:56,003 INFO L225 Difference]: With dead ends: 352 [2022-07-12 11:03:56,003 INFO L226 Difference]: Without dead ends: 180 [2022-07-12 11:03:56,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 303 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=1952, Unknown=0, NotChecked=0, Total=2162 [2022-07-12 11:03:56,005 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 197 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 2770 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 3141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:56,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1963 Invalid, 3141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2770 Invalid, 0 Unknown, 223 Unchecked, 2.6s Time] [2022-07-12 11:03:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-12 11:03:56,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2022-07-12 11:03:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 111 states have (on average 1.2162162162162162) internal successors, (135), 114 states have internal predecessors, (135), 49 states have call successors, (49), 13 states have call predecessors, (49), 15 states have return successors, (59), 48 states have call predecessors, (59), 48 states have call successors, (59) [2022-07-12 11:03:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 243 transitions. [2022-07-12 11:03:56,023 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 243 transitions. Word has length 140 [2022-07-12 11:03:56,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:56,023 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 243 transitions. [2022-07-12 11:03:56,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 21 states have internal predecessors, (121), 11 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (53), 10 states have call predecessors, (53), 10 states have call successors, (53) [2022-07-12 11:03:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 243 transitions. [2022-07-12 11:03:56,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-12 11:03:56,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:56,026 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-12 11:03:56,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:56,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:56,240 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:56,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:56,240 INFO L85 PathProgramCache]: Analyzing trace with hash 325366486, now seen corresponding path program 1 times [2022-07-12 11:03:56,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:56,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097604500] [2022-07-12 11:03:56,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:56,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:03:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:03:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:03:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:03:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:03:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:03:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:03:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:03:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:03:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:03:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:03:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 11:03:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:03:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 11:03:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:03:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:03:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 11:03:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-07-12 11:03:56,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:56,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097604500] [2022-07-12 11:03:56,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097604500] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:56,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152743991] [2022-07-12 11:03:56,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:56,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:56,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:56,863 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:56,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 11:03:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:57,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 2982 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:03:57,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-07-12 11:03:57,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:03:57,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152743991] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:57,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:03:57,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2022-07-12 11:03:57,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970554978] [2022-07-12 11:03:57,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:57,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:03:57,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:57,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:03:57,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:03:57,531 INFO L87 Difference]: Start difference. First operand 176 states and 243 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 11:03:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:57,690 INFO L93 Difference]: Finished difference Result 330 states and 468 transitions. [2022-07-12 11:03:57,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:03:57,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 155 [2022-07-12 11:03:57,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:57,692 INFO L225 Difference]: With dead ends: 330 [2022-07-12 11:03:57,693 INFO L226 Difference]: Without dead ends: 181 [2022-07-12 11:03:57,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:03:57,694 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 12 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:57,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1591 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:03:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-12 11:03:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-07-12 11:03:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 115 states have (on average 1.208695652173913) internal successors, (139), 119 states have internal predecessors, (139), 49 states have call successors, (49), 13 states have call predecessors, (49), 16 states have return successors, (68), 48 states have call predecessors, (68), 48 states have call successors, (68) [2022-07-12 11:03:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 256 transitions. [2022-07-12 11:03:57,707 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 256 transitions. Word has length 155 [2022-07-12 11:03:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:57,708 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 256 transitions. [2022-07-12 11:03:57,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 11:03:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2022-07-12 11:03:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 11:03:57,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:57,710 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:57,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:57,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:57,932 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:57,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:57,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1171187365, now seen corresponding path program 1 times [2022-07-12 11:03:57,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:57,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308153676] [2022-07-12 11:03:57,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:57,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:03:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:03:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:03:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:03:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:03:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:03:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:03:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:03:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:03:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:03:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:03:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:03:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 11:03:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:03:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 11:03:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:03:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:03:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-07-12 11:03:58,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:58,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308153676] [2022-07-12 11:03:58,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308153676] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:58,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80226782] [2022-07-12 11:03:58,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:58,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:58,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:58,511 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:58,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 11:03:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:59,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 2987 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 11:03:59,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-07-12 11:03:59,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:03:59,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80226782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:59,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:03:59,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-07-12 11:03:59,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860421024] [2022-07-12 11:03:59,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:59,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:03:59,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:59,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:03:59,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:03:59,153 INFO L87 Difference]: Start difference. First operand 181 states and 256 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:03:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:59,443 INFO L93 Difference]: Finished difference Result 335 states and 491 transitions. [2022-07-12 11:03:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:03:59,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2022-07-12 11:03:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:59,445 INFO L225 Difference]: With dead ends: 335 [2022-07-12 11:03:59,445 INFO L226 Difference]: Without dead ends: 181 [2022-07-12 11:03:59,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:03:59,447 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 17 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:59,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 743 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2022-07-12 11:03:59,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-12 11:03:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-07-12 11:03:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 115 states have (on average 1.2) internal successors, (138), 119 states have internal predecessors, (138), 49 states have call successors, (49), 13 states have call predecessors, (49), 16 states have return successors, (68), 48 states have call predecessors, (68), 48 states have call successors, (68) [2022-07-12 11:03:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 255 transitions. [2022-07-12 11:03:59,459 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 255 transitions. Word has length 157 [2022-07-12 11:03:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:59,459 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 255 transitions. [2022-07-12 11:03:59,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:03:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 255 transitions. [2022-07-12 11:03:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 11:03:59,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:59,462 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:59,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:59,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 11:03:59,675 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:59,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:59,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1841607645, now seen corresponding path program 1 times [2022-07-12 11:03:59,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:59,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841555085] [2022-07-12 11:03:59,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:59,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:59,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:59,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:59,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:59,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:59,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:03:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:59,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:03:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:59,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:03:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:59,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:03:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:59,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:03:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:59,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:03:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:59,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:03:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:00,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:04:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:00,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:04:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:00,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:04:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:00,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:04:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:00,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:04:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:00,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 11:04:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:00,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:04:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:00,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 11:04:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:00,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:04:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:00,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:04:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-07-12 11:04:00,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:04:00,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841555085] [2022-07-12 11:04:00,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841555085] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:04:00,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913944500] [2022-07-12 11:04:00,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:04:00,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:04:00,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:04:00,164 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:04:00,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 11:04:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:00,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 2992 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 11:04:00,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:04:01,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-12 11:04:01,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-12 11:04:01,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 11:04:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-12 11:04:01,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:04:01,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913944500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:04:01,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:04:01,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 18 [2022-07-12 11:04:01,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802829549] [2022-07-12 11:04:01,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:04:01,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 11:04:01,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:04:01,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 11:04:01,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-07-12 11:04:01,835 INFO L87 Difference]: Start difference. First operand 181 states and 255 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 12 states have internal predecessors, (73), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2022-07-12 11:04:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:04:03,712 INFO L93 Difference]: Finished difference Result 395 states and 580 transitions. [2022-07-12 11:04:03,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 11:04:03,713 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 12 states have internal predecessors, (73), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 157 [2022-07-12 11:04:03,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:04:03,715 INFO L225 Difference]: With dead ends: 395 [2022-07-12 11:04:03,715 INFO L226 Difference]: Without dead ends: 252 [2022-07-12 11:04:03,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 179 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-07-12 11:04:03,716 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 218 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:04:03,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1085 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1470 Invalid, 0 Unknown, 184 Unchecked, 1.6s Time] [2022-07-12 11:04:03,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-07-12 11:04:03,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 202. [2022-07-12 11:04:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 130 states have (on average 1.1846153846153846) internal successors, (154), 134 states have internal predecessors, (154), 53 states have call successors, (53), 14 states have call predecessors, (53), 18 states have return successors, (82), 53 states have call predecessors, (82), 52 states have call successors, (82) [2022-07-12 11:04:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 289 transitions. [2022-07-12 11:04:03,736 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 289 transitions. Word has length 157 [2022-07-12 11:04:03,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:04:03,738 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 289 transitions. [2022-07-12 11:04:03,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 12 states have internal predecessors, (73), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2022-07-12 11:04:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 289 transitions. [2022-07-12 11:04:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 11:04:03,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:04:03,740 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:04:03,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 11:04:03,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 11:04:03,963 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:04:03,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:04:03,964 INFO L85 PathProgramCache]: Analyzing trace with hash -208801253, now seen corresponding path program 1 times [2022-07-12 11:04:03,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:04:03,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505862596] [2022-07-12 11:04:03,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:04:03,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:04:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:04:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:04:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:04:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:04:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:04:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:04:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:04:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:04:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:04:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:04:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:04:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:04:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:04:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:04:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:04:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:04:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 11:04:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:04:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 11:04:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:04:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:04:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-07-12 11:04:04,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:04:04,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505862596] [2022-07-12 11:04:04,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505862596] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:04:04,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561579368] [2022-07-12 11:04:04,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:04:04,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:04:04,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:04:04,240 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:04:04,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 11:04:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:04,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 2987 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:04:04,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:04:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-07-12 11:04:04,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:04:04,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561579368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:04:04,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:04:04,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-12 11:04:04,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998648984] [2022-07-12 11:04:04,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:04:04,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:04:04,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:04:04,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:04:04,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:04:04,873 INFO L87 Difference]: Start difference. First operand 202 states and 289 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:04:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:04:04,904 INFO L93 Difference]: Finished difference Result 353 states and 515 transitions. [2022-07-12 11:04:04,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:04:04,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2022-07-12 11:04:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:04:04,906 INFO L225 Difference]: With dead ends: 353 [2022-07-12 11:04:04,906 INFO L226 Difference]: Without dead ends: 190 [2022-07-12 11:04:04,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:04:04,908 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 6 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:04:04,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 628 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:04:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-12 11:04:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2022-07-12 11:04:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 120 states have (on average 1.1833333333333333) internal successors, (142), 124 states have internal predecessors, (142), 49 states have call successors, (49), 14 states have call predecessors, (49), 17 states have return successors, (68), 48 states have call predecessors, (68), 48 states have call successors, (68) [2022-07-12 11:04:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 259 transitions. [2022-07-12 11:04:04,922 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 259 transitions. Word has length 157 [2022-07-12 11:04:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:04:04,922 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 259 transitions. [2022-07-12 11:04:04,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:04:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 259 transitions. [2022-07-12 11:04:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-12 11:04:04,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:04:04,924 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:04:04,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 11:04:05,148 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,SelfDestructingSolverStorable13 [2022-07-12 11:04:05,149 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:04:05,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:04:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1424932433, now seen corresponding path program 1 times [2022-07-12 11:04:05,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:04:05,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387470298] [2022-07-12 11:04:05,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:04:05,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:04:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:04:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:04:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:04:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:04:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:04:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:04:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:04:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:04:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:04:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:04:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:04:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:04:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:04:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:04:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 11:04:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:04:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:04:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:04:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:04:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 11:04:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:04:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:04:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2022-07-12 11:04:05,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:04:05,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387470298] [2022-07-12 11:04:05,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387470298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:04:05,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:04:05,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:04:05,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665593147] [2022-07-12 11:04:05,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:04:05,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:04:05,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:04:05,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:04:05,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:04:05,627 INFO L87 Difference]: Start difference. First operand 187 states and 259 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 4 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-12 11:04:06,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:04:06,635 INFO L93 Difference]: Finished difference Result 349 states and 491 transitions. [2022-07-12 11:04:06,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:04:06,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 4 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 164 [2022-07-12 11:04:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:04:06,638 INFO L225 Difference]: With dead ends: 349 [2022-07-12 11:04:06,638 INFO L226 Difference]: Without dead ends: 190 [2022-07-12 11:04:06,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:04:06,639 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 123 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:04:06,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 562 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 11:04:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-12 11:04:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2022-07-12 11:04:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 120 states have (on average 1.175) internal successors, (141), 124 states have internal predecessors, (141), 49 states have call successors, (49), 14 states have call predecessors, (49), 17 states have return successors, (68), 48 states have call predecessors, (68), 48 states have call successors, (68) [2022-07-12 11:04:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 258 transitions. [2022-07-12 11:04:06,653 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 258 transitions. Word has length 164 [2022-07-12 11:04:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:04:06,653 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 258 transitions. [2022-07-12 11:04:06,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 4 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-12 11:04:06,654 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 258 transitions. [2022-07-12 11:04:06,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-12 11:04:06,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:04:06,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:04:06,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 11:04:06,656 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:04:06,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:04:06,656 INFO L85 PathProgramCache]: Analyzing trace with hash 706686844, now seen corresponding path program 1 times [2022-07-12 11:04:06,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:04:06,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268224851] [2022-07-12 11:04:06,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:04:06,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:04:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:06,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:04:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:06,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:04:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:06,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:04:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:06,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:04:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:06,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:04:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:06,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:04:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:04:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:04:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:04:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:04:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:04:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:04:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:04:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:04:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:04:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:04:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:04:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:04:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:04:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:04:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 11:04:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 11:04:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 11:04:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 11:04:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,189 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2022-07-12 11:04:07,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:04:07,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268224851] [2022-07-12 11:04:07,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268224851] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:04:07,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82806737] [2022-07-12 11:04:07,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:04:07,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:04:07,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:04:07,196 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:04:07,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 11:04:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:07,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 3074 conjuncts, 133 conjunts are in the unsatisfiable core [2022-07-12 11:04:07,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:04:07,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:04:07,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:04:07,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:04:07,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 11:04:07,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:04:08,021 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 11:04:08,022 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 12 treesize of output 14 [2022-07-12 11:04:08,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:04:09,090 INFO L356 Elim1Store]: treesize reduction 154, result has 24.5 percent of original size [2022-07-12 11:04:09,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 71 [2022-07-12 11:04:09,204 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 17 treesize of output 19 [2022-07-12 11:04:09,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2022-07-12 11:04:09,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2022-07-12 11:04:09,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 11:04:09,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 20 [2022-07-12 11:04:09,772 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-07-12 11:04:09,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 32 [2022-07-12 11:04:09,836 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2769 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_2769) |c_#memory_int|)) is different from true [2022-07-12 11:04:09,842 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2770 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_2770) |c_#memory_int|)) is different from true [2022-07-12 11:04:09,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 11:04:12,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 11:04:27,157 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-12 11:04:27,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 1 [2022-07-12 11:04:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 179 proven. 103 refuted. 0 times theorem prover too weak. 64 trivial. 2 not checked. [2022-07-12 11:04:27,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:04:27,468 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2771 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#dest_copy~0#1.base| v_ArrVal_2771) |c_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.base|) |c_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.offset|) 18446744073709551616) 0))) is different from false [2022-07-12 11:04:27,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82806737] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:04:27,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:04:27,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 33] total 38 [2022-07-12 11:04:27,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854896669] [2022-07-12 11:04:27,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:04:27,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-12 11:04:27,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:04:27,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-12 11:04:27,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1649, Unknown=4, NotChecked=252, Total=2070 [2022-07-12 11:04:27,481 INFO L87 Difference]: Start difference. First operand 187 states and 258 transitions. Second operand has 38 states, 36 states have (on average 4.055555555555555) internal successors, (146), 33 states have internal predecessors, (146), 13 states have call successors, (49), 12 states have call predecessors, (49), 12 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) [2022-07-12 11:04:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:04:37,275 INFO L93 Difference]: Finished difference Result 364 states and 500 transitions. [2022-07-12 11:04:37,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 11:04:37,275 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 4.055555555555555) internal successors, (146), 33 states have internal predecessors, (146), 13 states have call successors, (49), 12 states have call predecessors, (49), 12 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) Word has length 175 [2022-07-12 11:04:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:04:37,277 INFO L225 Difference]: With dead ends: 364 [2022-07-12 11:04:37,277 INFO L226 Difference]: Without dead ends: 213 [2022-07-12 11:04:37,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 239 SyntacticMatches, 25 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=280, Invalid=2693, Unknown=9, NotChecked=324, Total=3306 [2022-07-12 11:04:37,279 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 139 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1171 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:04:37,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1118 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 833 Invalid, 0 Unknown, 1171 Unchecked, 1.3s Time] [2022-07-12 11:04:37,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-12 11:04:37,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 204. [2022-07-12 11:04:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 135 states have (on average 1.1703703703703703) internal successors, (158), 138 states have internal predecessors, (158), 49 states have call successors, (49), 17 states have call predecessors, (49), 19 states have return successors, (59), 48 states have call predecessors, (59), 48 states have call successors, (59) [2022-07-12 11:04:37,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 266 transitions. [2022-07-12 11:04:37,294 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 266 transitions. Word has length 175 [2022-07-12 11:04:37,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:04:37,295 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 266 transitions. [2022-07-12 11:04:37,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 4.055555555555555) internal successors, (146), 33 states have internal predecessors, (146), 13 states have call successors, (49), 12 states have call predecessors, (49), 12 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) [2022-07-12 11:04:37,296 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 266 transitions. [2022-07-12 11:04:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-12 11:04:37,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:04:37,297 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:04:37,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-12 11:04:37,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 11:04:37,523 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:04:37,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:04:37,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1314967907, now seen corresponding path program 2 times [2022-07-12 11:04:37,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:04:37,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255702035] [2022-07-12 11:04:37,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:04:37,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:04:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:37,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:04:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:37,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:04:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:37,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:04:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:04:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:37,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:04:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:37,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:04:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:37,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:04:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:37,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:04:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:37,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:04:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:37,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:04:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:37,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:04:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:04:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:37,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:04:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:37,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:04:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:38,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:04:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:38,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 11:04:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:38,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:04:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:38,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 11:04:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:38,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:04:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:38,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 11:04:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:38,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 11:04:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:38,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 11:04:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:38,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 11:04:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:38,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 11:04:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:04:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2022-07-12 11:04:38,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:04:38,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255702035] [2022-07-12 11:04:38,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255702035] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:04:38,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723709761] [2022-07-12 11:04:38,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:04:38,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:04:38,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:04:38,075 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:04:38,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 11:04:39,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:04:39,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:04:39,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 3205 conjuncts, 142 conjunts are in the unsatisfiable core [2022-07-12 11:04:39,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:04:39,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:04:39,350 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:04:39,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:04:39,442 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:04:39,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:04:39,930 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 11:04:39,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 11:04:39,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 11:04:42,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 11:04:42,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:04:48,435 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:04:48,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-07-12 11:04:48,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-12 11:04:48,567 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:04:48,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 27 [2022-07-12 11:04:49,246 INFO L356 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-07-12 11:04:49,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 61 [2022-07-12 11:04:49,698 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 11:04:49,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 11:04:49,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:04:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 111 proven. 167 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-12 11:04:50,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:04:50,637 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3291 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_aws_byte_cursor_read_aws_byte_cursor_advance_nospec_~#rv~7#1.base| v_ArrVal_3291) |c_aws_byte_cursor_read_aws_byte_cursor_advance_nospec_~cursor#1.base|) |c_aws_byte_cursor_read_aws_byte_cursor_advance_nospec_~cursor#1.offset|) 18446744073709551616) 0)) is different from false [2022-07-12 11:04:50,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723709761] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:04:50,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:04:50,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 38] total 44 [2022-07-12 11:04:50,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577495922] [2022-07-12 11:04:50,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:04:50,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-12 11:04:50,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:04:50,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-12 11:04:50,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2728, Unknown=34, NotChecked=106, Total=3080 [2022-07-12 11:04:50,707 INFO L87 Difference]: Start difference. First operand 204 states and 266 transitions. Second operand has 44 states, 41 states have (on average 3.6097560975609757) internal successors, (148), 38 states have internal predecessors, (148), 13 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (46), 11 states have call predecessors, (46), 13 states have call successors, (46) [2022-07-12 11:05:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:00,711 INFO L93 Difference]: Finished difference Result 450 states and 607 transitions. [2022-07-12 11:05:00,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-12 11:05:00,716 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 3.6097560975609757) internal successors, (148), 38 states have internal predecessors, (148), 13 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (46), 11 states have call predecessors, (46), 13 states have call successors, (46) Word has length 176 [2022-07-12 11:05:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:00,718 INFO L225 Difference]: With dead ends: 450 [2022-07-12 11:05:00,718 INFO L226 Difference]: Without dead ends: 294 [2022-07-12 11:05:00,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 34 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=404, Invalid=5404, Unknown=48, NotChecked=150, Total=6006 [2022-07-12 11:05:00,721 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 212 mSDsluCounter, 2246 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 2447 SdHoareTripleChecker+Invalid, 3724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2674 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:00,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 2447 Invalid, 3724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 900 Invalid, 0 Unknown, 2674 Unchecked, 0.9s Time] [2022-07-12 11:05:00,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-12 11:05:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 247. [2022-07-12 11:05:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 171 states have (on average 1.1754385964912282) internal successors, (201), 174 states have internal predecessors, (201), 51 states have call successors, (51), 22 states have call predecessors, (51), 24 states have return successors, (61), 50 states have call predecessors, (61), 50 states have call successors, (61) [2022-07-12 11:05:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 313 transitions. [2022-07-12 11:05:00,758 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 313 transitions. Word has length 176 [2022-07-12 11:05:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:00,758 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 313 transitions. [2022-07-12 11:05:00,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 3.6097560975609757) internal successors, (148), 38 states have internal predecessors, (148), 13 states have call successors, (49), 12 states have call predecessors, (49), 11 states have return successors, (46), 11 states have call predecessors, (46), 13 states have call successors, (46) [2022-07-12 11:05:00,759 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 313 transitions. [2022-07-12 11:05:00,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-12 11:05:00,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:00,760 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:05:00,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 11:05:00,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 11:05:00,983 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:00,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:00,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1727271069, now seen corresponding path program 1 times [2022-07-12 11:05:00,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:00,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534203916] [2022-07-12 11:05:00,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:00,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:05:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:05:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:05:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:05:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:05:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:05:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:05:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:05:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:05:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 11:05:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:05:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:05:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 11:05:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 11:05:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:05:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 11:05:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 11:05:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 11:05:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 11:05:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-07-12 11:05:01,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:01,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534203916] [2022-07-12 11:05:01,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534203916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:01,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:01,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 11:05:01,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018249491] [2022-07-12 11:05:01,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:01,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:05:01,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:01,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:05:01,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:05:01,526 INFO L87 Difference]: Start difference. First operand 247 states and 313 transitions. Second operand has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (25), 4 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-12 11:05:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:03,354 INFO L93 Difference]: Finished difference Result 268 states and 342 transitions. [2022-07-12 11:05:03,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 11:05:03,355 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (25), 4 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2022-07-12 11:05:03,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:03,356 INFO L225 Difference]: With dead ends: 268 [2022-07-12 11:05:03,356 INFO L226 Difference]: Without dead ends: 266 [2022-07-12 11:05:03,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2022-07-12 11:05:03,358 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 152 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:03,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1271 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 11:05:03,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-12 11:05:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 248. [2022-07-12 11:05:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 172 states have (on average 1.1744186046511629) internal successors, (202), 175 states have internal predecessors, (202), 51 states have call successors, (51), 22 states have call predecessors, (51), 24 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2022-07-12 11:05:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 313 transitions. [2022-07-12 11:05:03,376 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 313 transitions. Word has length 179 [2022-07-12 11:05:03,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:03,377 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 313 transitions. [2022-07-12 11:05:03,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (25), 4 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-12 11:05:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 313 transitions. [2022-07-12 11:05:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-12 11:05:03,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:03,378 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:05:03,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 11:05:03,379 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:03,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:03,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1621799858, now seen corresponding path program 1 times [2022-07-12 11:05:03,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:03,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452369331] [2022-07-12 11:05:03,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:03,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:05:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:05:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:05:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:05:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:05:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:05:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:05:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:05:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:05:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 11:05:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:05:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:05:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 11:05:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 11:05:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:05:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 11:05:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 11:05:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 11:05:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 11:05:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-07-12 11:05:03,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:03,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452369331] [2022-07-12 11:05:03,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452369331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:03,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:03,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:05:03,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308492397] [2022-07-12 11:05:03,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:03,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:05:03,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:03,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:05:03,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:05:03,723 INFO L87 Difference]: Start difference. First operand 248 states and 313 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 11:05:04,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:04,310 INFO L93 Difference]: Finished difference Result 368 states and 475 transitions. [2022-07-12 11:05:04,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:05:04,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2022-07-12 11:05:04,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:04,313 INFO L225 Difference]: With dead ends: 368 [2022-07-12 11:05:04,313 INFO L226 Difference]: Without dead ends: 253 [2022-07-12 11:05:04,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:05:04,314 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 106 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:04,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 376 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 11:05:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-12 11:05:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2022-07-12 11:05:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 174 states have (on average 1.1724137931034482) internal successors, (204), 177 states have internal predecessors, (204), 51 states have call successors, (51), 22 states have call predecessors, (51), 24 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2022-07-12 11:05:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 315 transitions. [2022-07-12 11:05:04,332 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 315 transitions. Word has length 180 [2022-07-12 11:05:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:04,333 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 315 transitions. [2022-07-12 11:05:04,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 11:05:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 315 transitions. [2022-07-12 11:05:04,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-12 11:05:04,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:04,336 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:05:04,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 11:05:04,336 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:04,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:04,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1199098032, now seen corresponding path program 1 times [2022-07-12 11:05:04,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:04,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003582926] [2022-07-12 11:05:04,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:04,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:04,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:04,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:04,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:05:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:05:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:05:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:05:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:05:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:05:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:05:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:05:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:05:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 11:05:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:05:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:05:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 11:05:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 11:05:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:05:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 11:05:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 11:05:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 11:05:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 11:05:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2022-07-12 11:05:05,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:05,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003582926] [2022-07-12 11:05:05,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003582926] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:05:05,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542837054] [2022-07-12 11:05:05,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:05,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:05:05,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:05:05,235 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:05:05,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 11:05:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:06,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 3422 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-12 11:05:06,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:05:06,404 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 11:05:06,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 25 [2022-07-12 11:05:06,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-07-12 11:05:06,538 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4938 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_4938))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-07-12 11:05:06,544 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_4940 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_4940) |c_#memory_int|))) is different from true [2022-07-12 11:05:06,551 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4942 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_4942) |c_#memory_int|)) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-07-12 11:05:08,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:05:08,621 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-12 11:05:09,495 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 142 proven. 116 refuted. 0 times theorem prover too weak. 88 trivial. 7 not checked. [2022-07-12 11:05:09,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:05:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2022-07-12 11:05:10,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542837054] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:05:10,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:05:10,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 27, 10] total 41 [2022-07-12 11:05:10,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749599364] [2022-07-12 11:05:10,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:05:10,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 11:05:10,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:10,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 11:05:10,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1293, Unknown=11, NotChecked=222, Total=1640 [2022-07-12 11:05:10,008 INFO L87 Difference]: Start difference. First operand 250 states and 315 transitions. Second operand has 41 states, 39 states have (on average 4.051282051282051) internal successors, (158), 36 states have internal predecessors, (158), 13 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (53), 11 states have call predecessors, (53), 13 states have call successors, (53) [2022-07-12 11:05:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:24,203 INFO L93 Difference]: Finished difference Result 591 states and 802 transitions. [2022-07-12 11:05:24,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-12 11:05:24,204 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 4.051282051282051) internal successors, (158), 36 states have internal predecessors, (158), 13 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (53), 11 states have call predecessors, (53), 13 states have call successors, (53) Word has length 180 [2022-07-12 11:05:24,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:24,206 INFO L225 Difference]: With dead ends: 591 [2022-07-12 11:05:24,206 INFO L226 Difference]: Without dead ends: 410 [2022-07-12 11:05:24,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 360 SyntacticMatches, 21 SemanticMatches, 74 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=415, Invalid=4819, Unknown=34, NotChecked=432, Total=5700 [2022-07-12 11:05:24,209 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 342 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 2850 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 5119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 2850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1973 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:24,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 2441 Invalid, 5119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 2850 Invalid, 0 Unknown, 1973 Unchecked, 2.8s Time] [2022-07-12 11:05:24,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-12 11:05:24,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 284. [2022-07-12 11:05:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 198 states have (on average 1.1565656565656566) internal successors, (229), 202 states have internal predecessors, (229), 58 states have call successors, (58), 25 states have call predecessors, (58), 27 states have return successors, (69), 56 states have call predecessors, (69), 57 states have call successors, (69) [2022-07-12 11:05:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 356 transitions. [2022-07-12 11:05:24,234 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 356 transitions. Word has length 180 [2022-07-12 11:05:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:24,235 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 356 transitions. [2022-07-12 11:05:24,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 4.051282051282051) internal successors, (158), 36 states have internal predecessors, (158), 13 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (53), 11 states have call predecessors, (53), 13 states have call successors, (53) [2022-07-12 11:05:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 356 transitions. [2022-07-12 11:05:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-12 11:05:24,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:24,237 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:05:24,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-12 11:05:24,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-07-12 11:05:24,455 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:24,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:24,456 INFO L85 PathProgramCache]: Analyzing trace with hash 395518589, now seen corresponding path program 3 times [2022-07-12 11:05:24,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:24,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704502358] [2022-07-12 11:05:24,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:24,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:05:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:05:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:05:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:05:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:05:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:05:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:05:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:05:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:05:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:05:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:05:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 11:05:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:05:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 11:05:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 11:05:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 11:05:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 11:05:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 11:05:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 11:05:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 42 proven. 11 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-07-12 11:05:25,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:25,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704502358] [2022-07-12 11:05:25,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704502358] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:05:25,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022771698] [2022-07-12 11:05:25,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 11:05:25,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:05:25,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:05:25,632 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:05:25,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 11:05:26,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-12 11:05:26,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:05:26,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 2500 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:05:26,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:05:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2022-07-12 11:05:27,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:05:27,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022771698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:27,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:05:27,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2022-07-12 11:05:27,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311482062] [2022-07-12 11:05:27,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:27,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:05:27,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:27,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:05:27,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2022-07-12 11:05:27,052 INFO L87 Difference]: Start difference. First operand 284 states and 356 transitions. Second operand has 9 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 11:05:27,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:27,232 INFO L93 Difference]: Finished difference Result 414 states and 532 transitions. [2022-07-12 11:05:27,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:05:27,233 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 186 [2022-07-12 11:05:27,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:27,234 INFO L225 Difference]: With dead ends: 414 [2022-07-12 11:05:27,235 INFO L226 Difference]: Without dead ends: 294 [2022-07-12 11:05:27,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-07-12 11:05:27,237 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 11 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:27,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1582 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:05:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-12 11:05:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-07-12 11:05:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 206 states have (on average 1.1504854368932038) internal successors, (237), 212 states have internal predecessors, (237), 58 states have call successors, (58), 25 states have call predecessors, (58), 29 states have return successors, (72), 56 states have call predecessors, (72), 57 states have call successors, (72) [2022-07-12 11:05:27,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 367 transitions. [2022-07-12 11:05:27,268 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 367 transitions. Word has length 186 [2022-07-12 11:05:27,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:27,269 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 367 transitions. [2022-07-12 11:05:27,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 11:05:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 367 transitions. [2022-07-12 11:05:27,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-12 11:05:27,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:27,271 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:05:27,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 11:05:27,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:05:27,499 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:27,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash 598020191, now seen corresponding path program 1 times [2022-07-12 11:05:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:27,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678941843] [2022-07-12 11:05:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:05:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:05:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:05:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:05:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:05:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:05:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:05:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:05:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:05:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:05:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:05:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 11:05:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:05:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 11:05:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 11:05:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 11:05:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 11:05:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:05:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 11:05:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 11:05:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 11:05:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2022-07-12 11:05:27,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:27,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678941843] [2022-07-12 11:05:27,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678941843] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:27,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:27,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:05:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155165755] [2022-07-12 11:05:27,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:27,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:05:27,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:27,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:05:27,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:05:27,892 INFO L87 Difference]: Start difference. First operand 294 states and 367 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 11:05:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:28,645 INFO L93 Difference]: Finished difference Result 397 states and 502 transitions. [2022-07-12 11:05:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:05:28,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2022-07-12 11:05:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:28,649 INFO L225 Difference]: With dead ends: 397 [2022-07-12 11:05:28,649 INFO L226 Difference]: Without dead ends: 294 [2022-07-12 11:05:28,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:05:28,650 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 130 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:28,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 555 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 11:05:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-12 11:05:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2022-07-12 11:05:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 204 states have (on average 1.142156862745098) internal successors, (233), 209 states have internal predecessors, (233), 58 states have call successors, (58), 25 states have call predecessors, (58), 28 states have return successors, (71), 56 states have call predecessors, (71), 57 states have call successors, (71) [2022-07-12 11:05:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 362 transitions. [2022-07-12 11:05:28,672 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 362 transitions. Word has length 190 [2022-07-12 11:05:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:28,673 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 362 transitions. [2022-07-12 11:05:28,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 11:05:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 362 transitions. [2022-07-12 11:05:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-12 11:05:28,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:28,675 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:05:28,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 11:05:28,675 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:28,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1090243964, now seen corresponding path program 4 times [2022-07-12 11:05:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:28,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47612646] [2022-07-12 11:05:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:05:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:05:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:05:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:05:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:05:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:05:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:05:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:05:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:05:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:05:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:05:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 11:05:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:05:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 11:05:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 11:05:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 11:05:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 11:05:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 11:05:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 11:05:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-07-12 11:05:29,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:29,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47612646] [2022-07-12 11:05:29,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47612646] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:05:29,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604678842] [2022-07-12 11:05:29,562 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 11:05:29,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:05:29,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:05:29,564 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:05:29,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 11:05:30,483 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 11:05:30,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:05:30,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 3501 conjuncts, 123 conjunts are in the unsatisfiable core [2022-07-12 11:05:30,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:05:30,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:05:31,004 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:05:31,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-07-12 11:05:31,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-12 11:05:31,052 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:05:31,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 27 [2022-07-12 11:05:31,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-12 11:05:31,083 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7215 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_7215) |c_#memory_$Pointer$.base|)) is different from true [2022-07-12 11:05:31,087 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7220 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_7220))) is different from true [2022-07-12 11:05:31,092 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7229 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_7229))) is different from true [2022-07-12 11:05:31,096 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7240 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_7240) |c_#memory_$Pointer$.base|)) is different from true [2022-07-12 11:05:31,102 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7244 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_7244))) is different from true [2022-07-12 11:05:31,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:05:31,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:05:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 179 proven. 122 refuted. 0 times theorem prover too weak. 67 trivial. 11 not checked. [2022-07-12 11:05:32,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:05:32,680 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-12 11:05:32,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-12 11:05:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-07-12 11:05:32,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604678842] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:05:32,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:05:32,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 31, 14] total 51 [2022-07-12 11:05:32,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765975260] [2022-07-12 11:05:32,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:05:32,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-12 11:05:32,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:32,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-12 11:05:32,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1913, Unknown=5, NotChecked=460, Total=2550 [2022-07-12 11:05:32,885 INFO L87 Difference]: Start difference. First operand 291 states and 362 transitions. Second operand has 51 states, 47 states have (on average 4.0638297872340425) internal successors, (191), 46 states have internal predecessors, (191), 15 states have call successors, (57), 9 states have call predecessors, (57), 11 states have return successors, (50), 12 states have call predecessors, (50), 15 states have call successors, (50) [2022-07-12 11:05:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:43,562 INFO L93 Difference]: Finished difference Result 820 states and 1202 transitions. [2022-07-12 11:05:43,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-07-12 11:05:43,563 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 4.0638297872340425) internal successors, (191), 46 states have internal predecessors, (191), 15 states have call successors, (57), 9 states have call predecessors, (57), 11 states have return successors, (50), 12 states have call predecessors, (50), 15 states have call successors, (50) Word has length 188 [2022-07-12 11:05:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:43,567 INFO L225 Difference]: With dead ends: 820 [2022-07-12 11:05:43,567 INFO L226 Difference]: Without dead ends: 655 [2022-07-12 11:05:43,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 373 SyntacticMatches, 19 SemanticMatches, 117 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3908 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=922, Invalid=11945, Unknown=35, NotChecked=1140, Total=14042 [2022-07-12 11:05:43,572 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 366 mSDsluCounter, 4519 mSDsCounter, 0 mSdLazyCounter, 7384 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 4880 SdHoareTripleChecker+Invalid, 12199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 7384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4336 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:43,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 4880 Invalid, 12199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 7384 Invalid, 0 Unknown, 4336 Unchecked, 6.3s Time] [2022-07-12 11:05:43,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2022-07-12 11:05:43,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 375. [2022-07-12 11:05:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 256 states have (on average 1.13671875) internal successors, (291), 266 states have internal predecessors, (291), 82 states have call successors, (82), 29 states have call predecessors, (82), 36 states have return successors, (118), 79 states have call predecessors, (118), 81 states have call successors, (118) [2022-07-12 11:05:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 491 transitions. [2022-07-12 11:05:43,616 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 491 transitions. Word has length 188 [2022-07-12 11:05:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:43,616 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 491 transitions. [2022-07-12 11:05:43,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 4.0638297872340425) internal successors, (191), 46 states have internal predecessors, (191), 15 states have call successors, (57), 9 states have call predecessors, (57), 11 states have return successors, (50), 12 states have call predecessors, (50), 15 states have call successors, (50) [2022-07-12 11:05:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 491 transitions. [2022-07-12 11:05:43,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-12 11:05:43,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:43,619 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:05:43,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 11:05:43,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:05:43,833 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:43,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:43,834 INFO L85 PathProgramCache]: Analyzing trace with hash 140907588, now seen corresponding path program 1 times [2022-07-12 11:05:43,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:43,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842483047] [2022-07-12 11:05:43,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:43,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:05:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:05:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:05:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:05:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:05:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:05:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:05:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:05:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:05:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:05:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:05:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 11:05:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:05:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 11:05:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 11:05:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 11:05:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 11:05:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:05:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 11:05:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 11:05:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 11:05:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-07-12 11:05:44,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:44,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842483047] [2022-07-12 11:05:44,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842483047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:44,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:44,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:05:44,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939348764] [2022-07-12 11:05:44,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:44,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:05:44,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:44,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:05:44,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:05:44,330 INFO L87 Difference]: Start difference. First operand 375 states and 491 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2022-07-12 11:05:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:45,597 INFO L93 Difference]: Finished difference Result 392 states and 518 transitions. [2022-07-12 11:05:45,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 11:05:45,599 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2022-07-12 11:05:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:45,602 INFO L225 Difference]: With dead ends: 392 [2022-07-12 11:05:45,602 INFO L226 Difference]: Without dead ends: 390 [2022-07-12 11:05:45,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:05:45,603 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 121 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:45,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 899 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 11:05:45,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-07-12 11:05:45,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 385. [2022-07-12 11:05:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 262 states have (on average 1.133587786259542) internal successors, (297), 273 states have internal predecessors, (297), 84 states have call successors, (84), 30 states have call predecessors, (84), 38 states have return successors, (129), 81 states have call predecessors, (129), 83 states have call successors, (129) [2022-07-12 11:05:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 510 transitions. [2022-07-12 11:05:45,655 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 510 transitions. Word has length 192 [2022-07-12 11:05:45,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:45,656 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 510 transitions. [2022-07-12 11:05:45,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 1 states have call successors, (25) [2022-07-12 11:05:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 510 transitions. [2022-07-12 11:05:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-12 11:05:45,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:45,658 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:05:45,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 11:05:45,659 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:45,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:45,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1164963246, now seen corresponding path program 1 times [2022-07-12 11:05:45,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:45,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963475844] [2022-07-12 11:05:45,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:45,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:05:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:05:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:05:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:05:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:05:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:05:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:05:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:05:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:05:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:05:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:05:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 11:05:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:05:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:05:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 11:05:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 11:05:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 11:05:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 11:05:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 11:05:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 19 proven. 32 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-07-12 11:05:46,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:46,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963475844] [2022-07-12 11:05:46,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963475844] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:05:46,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244491267] [2022-07-12 11:05:46,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:46,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:05:46,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:05:46,514 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:05:46,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 11:05:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:47,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 3496 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:05:47,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:05:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-07-12 11:05:47,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:05:47,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244491267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:47,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:05:47,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2022-07-12 11:05:47,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674741580] [2022-07-12 11:05:47,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:47,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:05:47,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:47,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:05:47,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:05:47,544 INFO L87 Difference]: Start difference. First operand 385 states and 510 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 11:05:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:47,746 INFO L93 Difference]: Finished difference Result 609 states and 822 transitions. [2022-07-12 11:05:47,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:05:47,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 188 [2022-07-12 11:05:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:47,749 INFO L225 Difference]: With dead ends: 609 [2022-07-12 11:05:47,749 INFO L226 Difference]: Without dead ends: 363 [2022-07-12 11:05:47,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:05:47,753 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 3 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:47,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 552 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2022-07-12 11:05:47,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-12 11:05:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2022-07-12 11:05:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 244 states have (on average 1.1270491803278688) internal successors, (275), 252 states have internal predecessors, (275), 83 states have call successors, (83), 30 states have call predecessors, (83), 35 states have return successors, (114), 80 states have call predecessors, (114), 82 states have call successors, (114) [2022-07-12 11:05:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 472 transitions. [2022-07-12 11:05:47,792 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 472 transitions. Word has length 188 [2022-07-12 11:05:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:47,793 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 472 transitions. [2022-07-12 11:05:47,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 11:05:47,794 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 472 transitions. [2022-07-12 11:05:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-12 11:05:47,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:47,799 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 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, 1, 1] [2022-07-12 11:05:47,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 11:05:48,023 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,SelfDestructingSolverStorable24 [2022-07-12 11:05:48,023 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:48,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash 464813580, now seen corresponding path program 2 times [2022-07-12 11:05:48,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:48,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929205031] [2022-07-12 11:05:48,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:48,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:05:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:05:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:05:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:05:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:05:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:05:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:05:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:05:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:05:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:05:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:05:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 11:05:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:05:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 11:05:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 11:05:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 11:05:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 11:05:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:05:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 11:05:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 11:05:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 11:05:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2022-07-12 11:05:48,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:48,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929205031] [2022-07-12 11:05:48,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929205031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:48,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:48,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:05:48,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823455659] [2022-07-12 11:05:48,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:48,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:05:48,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:48,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:05:48,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:05:48,472 INFO L87 Difference]: Start difference. First operand 363 states and 472 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 11:05:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:49,659 INFO L93 Difference]: Finished difference Result 485 states and 650 transitions. [2022-07-12 11:05:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:05:49,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) Word has length 196 [2022-07-12 11:05:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:49,662 INFO L225 Difference]: With dead ends: 485 [2022-07-12 11:05:49,662 INFO L226 Difference]: Without dead ends: 377 [2022-07-12 11:05:49,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:05:49,664 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 128 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:49,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 578 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 11:05:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-12 11:05:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 370. [2022-07-12 11:05:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 246 states have (on average 1.1260162601626016) internal successors, (277), 255 states have internal predecessors, (277), 88 states have call successors, (88), 30 states have call predecessors, (88), 35 states have return successors, (121), 84 states have call predecessors, (121), 87 states have call successors, (121) [2022-07-12 11:05:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 486 transitions. [2022-07-12 11:05:49,701 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 486 transitions. Word has length 196 [2022-07-12 11:05:49,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:49,702 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 486 transitions. [2022-07-12 11:05:49,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 11:05:49,702 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 486 transitions. [2022-07-12 11:05:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-12 11:05:49,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:49,704 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:05:49,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 11:05:49,704 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:49,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:49,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1602850085, now seen corresponding path program 5 times [2022-07-12 11:05:49,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:49,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805479028] [2022-07-12 11:05:49,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:49,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:05:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:05:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:05:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:05:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:05:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:05:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:05:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:05:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:05:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:05:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:05:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 11:05:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:05:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:05:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:05:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 11:05:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 11:05:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 11:05:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 11:05:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2022-07-12 11:05:50,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:50,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805479028] [2022-07-12 11:05:50,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805479028] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:05:50,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986196653] [2022-07-12 11:05:50,653 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 11:05:50,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:05:50,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:05:50,656 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:05:50,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 11:06:14,070 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-07-12 11:06:14,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:06:14,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 11:06:14,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:06:14,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:06:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 247 proven. 5 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-12 11:06:14,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:06:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-07-12 11:06:14,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986196653] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:06:14,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:06:14,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 21 [2022-07-12 11:06:14,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942469542] [2022-07-12 11:06:14,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:06:14,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 11:06:14,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:06:14,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 11:06:14,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:06:14,713 INFO L87 Difference]: Start difference. First operand 370 states and 486 transitions. Second operand has 21 states, 20 states have (on average 6.1) internal successors, (122), 18 states have internal predecessors, (122), 4 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) [2022-07-12 11:06:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:06:17,443 INFO L93 Difference]: Finished difference Result 626 states and 840 transitions. [2022-07-12 11:06:17,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 11:06:17,444 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.1) internal successors, (122), 18 states have internal predecessors, (122), 4 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) Word has length 190 [2022-07-12 11:06:17,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:06:17,446 INFO L225 Difference]: With dead ends: 626 [2022-07-12 11:06:17,446 INFO L226 Difference]: Without dead ends: 417 [2022-07-12 11:06:17,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 409 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=215, Invalid=975, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 11:06:17,448 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 203 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 2542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:06:17,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1150 Invalid, 2542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 2077 Invalid, 0 Unknown, 273 Unchecked, 2.2s Time] [2022-07-12 11:06:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-07-12 11:06:17,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 354. [2022-07-12 11:06:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 234 states have (on average 1.123931623931624) internal successors, (263), 241 states have internal predecessors, (263), 85 states have call successors, (85), 31 states have call predecessors, (85), 34 states have return successors, (114), 81 states have call predecessors, (114), 84 states have call successors, (114) [2022-07-12 11:06:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 462 transitions. [2022-07-12 11:06:17,482 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 462 transitions. Word has length 190 [2022-07-12 11:06:17,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:06:17,483 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 462 transitions. [2022-07-12 11:06:17,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.1) internal successors, (122), 18 states have internal predecessors, (122), 4 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) [2022-07-12 11:06:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 462 transitions. [2022-07-12 11:06:17,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-12 11:06:17,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:06:17,485 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:06:17,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-12 11:06:17,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-12 11:06:17,699 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:06:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:06:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1520791916, now seen corresponding path program 1 times [2022-07-12 11:06:17,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:06:17,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664273620] [2022-07-12 11:06:17,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:06:17,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:06:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:06:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:06:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:06:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:06:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:06:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:06:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:06:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:06:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:06:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:06:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:06:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:06:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:06:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:06:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:06:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:06:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:06:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 11:06:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 11:06:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 11:06:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 11:06:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:06:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 11:06:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 11:06:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 49 proven. 30 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2022-07-12 11:06:19,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:06:19,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664273620] [2022-07-12 11:06:19,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664273620] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:06:19,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939816726] [2022-07-12 11:06:19,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:06:19,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:06:19,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:06:19,815 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:06:19,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-12 11:06:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:20,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 3533 conjuncts, 186 conjunts are in the unsatisfiable core [2022-07-12 11:06:20,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:06:20,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:06:20,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:06:21,112 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:06:21,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:06:21,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:06:21,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:06:21,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 11:06:21,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:06:22,659 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 11:06:22,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-12 11:06:22,751 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 39 treesize of output 37 [2022-07-12 11:06:23,073 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 39 treesize of output 37 [2022-07-12 11:06:23,159 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-12 11:06:23,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2022-07-12 11:06:23,245 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 22 treesize of output 10 [2022-07-12 11:06:23,784 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:06:23,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-07-12 11:06:23,789 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-12 11:06:24,082 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:06:24,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2022-07-12 11:06:25,344 INFO L356 Elim1Store]: treesize reduction 70, result has 28.6 percent of original size [2022-07-12 11:06:25,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 45 [2022-07-12 11:06:26,594 INFO L356 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2022-07-12 11:06:26,594 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 21 treesize of output 25 [2022-07-12 11:06:26,680 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 28 treesize of output 30 [2022-07-12 11:06:26,684 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 28 treesize of output 30 [2022-07-12 11:06:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 120 proven. 211 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 11:06:37,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:06:38,413 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_10983 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_aws_byte_cursor_read_aws_byte_cursor_advance_nospec_~#rv~7#1.base| v_ArrVal_10983) |c_aws_byte_cursor_read_aws_byte_cursor_advance_nospec_~cursor#1.base|) (+ |c_aws_byte_cursor_read_aws_byte_cursor_advance_nospec_~cursor#1.offset| 8)) 0))) (forall ((v_ArrVal_10982 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_aws_byte_cursor_read_aws_byte_cursor_advance_nospec_~#rv~7#1.base| v_ArrVal_10982) |c_aws_byte_cursor_read_aws_byte_cursor_advance_nospec_~cursor#1.base|) (+ |c_aws_byte_cursor_read_aws_byte_cursor_advance_nospec_~cursor#1.offset| 8)) 0)))) is different from false [2022-07-12 11:06:38,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939816726] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:06:38,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:06:38,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 40] total 68 [2022-07-12 11:06:38,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491622799] [2022-07-12 11:06:38,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:06:38,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-07-12 11:06:38,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:06:38,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-07-12 11:06:38,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=5056, Unknown=62, NotChecked=144, Total=5550 [2022-07-12 11:06:38,521 INFO L87 Difference]: Start difference. First operand 354 states and 462 transitions. Second operand has 68 states, 63 states have (on average 2.8253968253968256) internal successors, (178), 61 states have internal predecessors, (178), 23 states have call successors, (47), 14 states have call predecessors, (47), 17 states have return successors, (44), 22 states have call predecessors, (44), 22 states have call successors, (44) [2022-07-12 11:06:58,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:06:58,377 INFO L93 Difference]: Finished difference Result 600 states and 802 transitions. [2022-07-12 11:06:58,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-07-12 11:06:58,378 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 63 states have (on average 2.8253968253968256) internal successors, (178), 61 states have internal predecessors, (178), 23 states have call successors, (47), 14 states have call predecessors, (47), 17 states have return successors, (44), 22 states have call predecessors, (44), 22 states have call successors, (44) Word has length 196 [2022-07-12 11:06:58,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:06:58,381 INFO L225 Difference]: With dead ends: 600 [2022-07-12 11:06:58,381 INFO L226 Difference]: Without dead ends: 451 [2022-07-12 11:06:58,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 221 SyntacticMatches, 28 SemanticMatches, 148 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7158 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=1285, Invalid=20661, Unknown=110, NotChecked=294, Total=22350 [2022-07-12 11:06:58,387 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 245 mSDsluCounter, 2390 mSDsCounter, 0 mSdLazyCounter, 4274 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 2598 SdHoareTripleChecker+Invalid, 6866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 4274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2371 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:06:58,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 2598 Invalid, 6866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 4274 Invalid, 0 Unknown, 2371 Unchecked, 2.9s Time] [2022-07-12 11:06:58,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-07-12 11:06:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 414. [2022-07-12 11:06:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 281 states have (on average 1.1103202846975089) internal successors, (312), 289 states have internal predecessors, (312), 90 states have call successors, (90), 37 states have call predecessors, (90), 42 states have return successors, (121), 87 states have call predecessors, (121), 89 states have call successors, (121) [2022-07-12 11:06:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 523 transitions. [2022-07-12 11:06:58,429 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 523 transitions. Word has length 196 [2022-07-12 11:06:58,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:06:58,429 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 523 transitions. [2022-07-12 11:06:58,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 63 states have (on average 2.8253968253968256) internal successors, (178), 61 states have internal predecessors, (178), 23 states have call successors, (47), 14 states have call predecessors, (47), 17 states have return successors, (44), 22 states have call predecessors, (44), 22 states have call successors, (44) [2022-07-12 11:06:58,430 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 523 transitions. [2022-07-12 11:06:58,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-12 11:06:58,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:06:58,432 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:06:58,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-12 11:06:58,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-12 11:06:58,643 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:06:58,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:06:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash 467130592, now seen corresponding path program 1 times [2022-07-12 11:06:58,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:06:58,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536744205] [2022-07-12 11:06:58,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:06:58,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:06:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:06:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:06:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:06:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:06:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:06:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:06:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:06:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:06:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:06:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:06:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:06:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:06:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:06:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:06:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:06:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:06:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:06:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 11:06:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 11:06:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 11:06:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 11:06:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:06:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 11:06:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:59,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 11:06:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-07-12 11:07:00,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:07:00,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536744205] [2022-07-12 11:07:00,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536744205] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:07:00,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274697200] [2022-07-12 11:07:00,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:07:00,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:07:00,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:07:00,112 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:07:00,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-12 11:07:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:01,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 3619 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-12 11:07:01,249 INFO L286 TraceCheckSpWp]: Computing forward predicates...