./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_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 d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:58:36,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:58:36,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:58:36,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:58:36,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:58:36,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:58:36,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:58:36,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:58:36,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:58:36,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:58:36,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:58:36,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:58:36,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:58:36,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:58:36,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:58:36,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:58:36,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:58:36,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:58:36,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:58:36,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:58:36,557 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:58:36,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:58:36,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:58:36,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:58:36,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:58:36,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:58:36,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:58:36,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:58:36,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:58:36,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:58:36,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:58:36,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:58:36,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:58:36,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:58:36,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:58:36,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:58:36,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:58:36,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:58:36,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:58:36,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:58:36,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:58:36,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:58:36,582 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:58:36,609 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:58:36,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:58:36,610 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:58:36,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:58:36,611 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:58:36,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:58:36,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:58:36,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:58:36,612 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:58:36,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:58:36,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:58:36,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:58:36,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:58:36,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:58:36,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:58:36,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:58:36,615 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:58:36,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:58:36,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:58:36,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:58:36,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:58:36,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:58:36,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:58:36,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:58:36,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:58:36,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:58:36,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:58:36,617 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:58:36,618 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:58:36,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:58:36,618 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 -> d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd [2022-07-13 22:58:36,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:58:36,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:58:36,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:58:36,903 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:58:36,904 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:58:36,905 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-07-13 22:58:36,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee92ce304/00c20d70227b42ef8ab8ce20a442b12a/FLAG938ca328b [2022-07-13 22:58:37,588 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:58:37,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-07-13 22:58:37,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee92ce304/00c20d70227b42ef8ab8ce20a442b12a/FLAG938ca328b [2022-07-13 22:58:37,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee92ce304/00c20d70227b42ef8ab8ce20a442b12a [2022-07-13 22:58:37,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:58:37,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:58:37,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:58:37,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:58:37,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:58:37,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:58:37" (1/1) ... [2022-07-13 22:58:37,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44acee24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:37, skipping insertion in model container [2022-07-13 22:58:37,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:58:37" (1/1) ... [2022-07-13 22:58:37,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:58:37,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:58:38,146 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_string_new_from_c_str_harness.i[4499,4512] [2022-07-13 22:58:38,155 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_string_new_from_c_str_harness.i[4559,4572] [2022-07-13 22:58:39,083 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,085 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,087 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,088 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,090 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,109 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,111 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,113 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,114 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,411 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:58:39,412 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:58:39,413 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:58:39,414 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:58:39,414 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:58:39,423 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:58:39,424 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:58:39,424 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:58:39,425 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:58:39,425 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:58:39,553 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:58:39,640 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,640 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:58:39,793 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:58:39,814 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_string_new_from_c_str_harness.i[4499,4512] [2022-07-13 22:58:39,815 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_string_new_from_c_str_harness.i[4559,4572] [2022-07-13 22:58:39,836 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,836 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,837 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,838 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,839 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,847 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,849 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,849 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,850 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,900 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:58:39,904 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:58:39,905 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:58:39,906 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:58:39,907 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:58:39,907 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:58:39,908 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:58:39,908 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:58:39,909 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:58:39,909 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:58:39,934 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:58:39,992 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:39,992 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:40,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:58:40,245 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:58:40,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:40 WrapperNode [2022-07-13 22:58:40,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:58:40,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:58:40,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:58:40,247 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:58:40,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:40" (1/1) ... [2022-07-13 22:58:40,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:40" (1/1) ... [2022-07-13 22:58:40,459 INFO L137 Inliner]: procedures = 690, calls = 2735, calls flagged for inlining = 62, calls inlined = 9, statements flattened = 812 [2022-07-13 22:58:40,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:58:40,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:58:40,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:58:40,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:58:40,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:40" (1/1) ... [2022-07-13 22:58:40,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:40" (1/1) ... [2022-07-13 22:58:40,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:40" (1/1) ... [2022-07-13 22:58:40,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:40" (1/1) ... [2022-07-13 22:58:40,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:40" (1/1) ... [2022-07-13 22:58:40,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:40" (1/1) ... [2022-07-13 22:58:40,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:40" (1/1) ... [2022-07-13 22:58:40,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:58:40,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:58:40,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:58:40,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:58:40,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:40" (1/1) ... [2022-07-13 22:58:40,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:58:40,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:40,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 22:58:40,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 22:58:40,656 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-13 22:58:40,657 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-13 22:58:40,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:58:40,657 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:58:40,657 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:58:40,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-07-13 22:58:40,658 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-07-13 22:58:40,658 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-07-13 22:58:40,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-13 22:58:40,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-13 22:58:40,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:58:40,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-13 22:58:40,660 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-13 22:58:40,660 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-13 22:58:40,660 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-13 22:58:40,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:58:40,661 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:58:40,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:58:40,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:58:40,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:58:40,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:58:40,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:58:40,661 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:58:40,662 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:58:40,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-13 22:58:40,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 22:58:40,663 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-07-13 22:58:40,663 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-07-13 22:58:40,663 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:58:40,664 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:58:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-07-13 22:58:40,664 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-07-13 22:58:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:58:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-13 22:58:40,664 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-13 22:58:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:58:40,665 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2022-07-13 22:58:40,665 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2022-07-13 22:58:40,665 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-13 22:58:40,665 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-13 22:58:40,665 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-13 22:58:40,665 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-13 22:58:40,665 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-13 22:58:40,666 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-13 22:58:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:58:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-07-13 22:58:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:58:40,959 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:58:40,962 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:58:41,151 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2022-07-13 22:58:42,016 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:58:42,031 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:58:42,032 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 22:58:42,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:58:42 BoogieIcfgContainer [2022-07-13 22:58:42,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:58:42,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:58:42,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:58:42,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:58:42,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:58:37" (1/3) ... [2022-07-13 22:58:42,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70215d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:58:42, skipping insertion in model container [2022-07-13 22:58:42,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:40" (2/3) ... [2022-07-13 22:58:42,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70215d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:58:42, skipping insertion in model container [2022-07-13 22:58:42,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:58:42" (3/3) ... [2022-07-13 22:58:42,076 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_c_str_harness.i [2022-07-13 22:58:42,097 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:58:42,115 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:58:42,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:58:42,213 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@2ba64350, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1a469d9b [2022-07-13 22:58:42,214 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:58:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-07-13 22:58:42,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-13 22:58:42,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:42,229 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:42,232 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:42,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:42,238 INFO L85 PathProgramCache]: Analyzing trace with hash -555983859, now seen corresponding path program 1 times [2022-07-13 22:58:42,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:42,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852211082] [2022-07-13 22:58:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:42,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:42,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:42,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:42,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:58:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:42,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:42,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:58:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:42,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:42,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 22:58:42,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:42,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852211082] [2022-07-13 22:58:42,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852211082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:42,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:42,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 22:58:42,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774942457] [2022-07-13 22:58:42,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:42,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:58:42,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:42,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:58:42,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:58:42,993 INFO L87 Difference]: Start difference. First operand has 136 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 22:58:43,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:43,352 INFO L93 Difference]: Finished difference Result 283 states and 370 transitions. [2022-07-13 22:58:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 22:58:43,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 74 [2022-07-13 22:58:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:43,363 INFO L225 Difference]: With dead ends: 283 [2022-07-13 22:58:43,364 INFO L226 Difference]: Without dead ends: 147 [2022-07-13 22:58:43,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:58:43,370 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 99 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:43,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 198 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:58:43,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-13 22:58:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2022-07-13 22:58:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.15) internal successors, (92), 81 states have internal predecessors, (92), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-07-13 22:58:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2022-07-13 22:58:43,415 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 74 [2022-07-13 22:58:43,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:43,416 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2022-07-13 22:58:43,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 22:58:43,416 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2022-07-13 22:58:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-13 22:58:43,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:43,419 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:43,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:58:43,419 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:43,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:43,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1001240943, now seen corresponding path program 1 times [2022-07-13 22:58:43,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:43,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311320288] [2022-07-13 22:58:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:43,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:43,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:43,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:43,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:43,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:43,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:43,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:58:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:43,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:43,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:58:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:43,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:43,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:43,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:43,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 22:58:44,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:44,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311320288] [2022-07-13 22:58:44,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311320288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:44,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:44,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:58:44,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296200239] [2022-07-13 22:58:44,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:44,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:58:44,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:44,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:58:44,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:58:44,006 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-13 22:58:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:44,611 INFO L93 Difference]: Finished difference Result 196 states and 238 transitions. [2022-07-13 22:58:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:58:44,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2022-07-13 22:58:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:44,614 INFO L225 Difference]: With dead ends: 196 [2022-07-13 22:58:44,614 INFO L226 Difference]: Without dead ends: 152 [2022-07-13 22:58:44,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:58:44,615 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 101 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:44,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 382 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:58:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-13 22:58:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 135. [2022-07-13 22:58:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 85 states have internal predecessors, (96), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (34), 34 states have call predecessors, (34), 33 states have call successors, (34) [2022-07-13 22:58:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2022-07-13 22:58:44,630 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 74 [2022-07-13 22:58:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:44,631 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2022-07-13 22:58:44,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-13 22:58:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2022-07-13 22:58:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-13 22:58:44,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:44,633 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:44,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 22:58:44,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:44,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1994019405, now seen corresponding path program 1 times [2022-07-13 22:58:44,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:44,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275965086] [2022-07-13 22:58:44,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:44,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:44,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:44,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:44,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:44,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:44,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:44,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:58:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:44,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:44,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:58:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:44,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:44,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:44,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:45,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:45,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 22:58:45,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:45,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275965086] [2022-07-13 22:58:45,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275965086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:45,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:45,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:58:45,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550876108] [2022-07-13 22:58:45,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:45,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:58:45,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:45,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:58:45,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:58:45,042 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-13 22:58:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:45,884 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2022-07-13 22:58:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:58:45,885 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 80 [2022-07-13 22:58:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:45,887 INFO L225 Difference]: With dead ends: 217 [2022-07-13 22:58:45,887 INFO L226 Difference]: Without dead ends: 178 [2022-07-13 22:58:45,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:58:45,888 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 180 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:45,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 470 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 22:58:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-13 22:58:45,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 140. [2022-07-13 22:58:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 89 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 35 states have call predecessors, (35), 33 states have call successors, (35) [2022-07-13 22:58:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2022-07-13 22:58:45,908 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 80 [2022-07-13 22:58:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:45,909 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2022-07-13 22:58:45,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-13 22:58:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2022-07-13 22:58:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-13 22:58:45,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:45,915 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:45,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 22:58:45,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:45,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:45,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1920697878, now seen corresponding path program 1 times [2022-07-13 22:58:45,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:45,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053397472] [2022-07-13 22:58:45,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:45,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:46,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:46,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:46,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:46,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:46,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:46,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:58:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:46,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:46,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:58:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:46,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:46,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:46,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:46,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:46,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 22:58:46,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:46,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053397472] [2022-07-13 22:58:46,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053397472] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:46,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:46,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 22:58:46,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31455688] [2022-07-13 22:58:46,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:46,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:58:46,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:46,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:58:46,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:58:46,315 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 22:58:47,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:47,472 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2022-07-13 22:58:47,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 22:58:47,476 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 82 [2022-07-13 22:58:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:47,478 INFO L225 Difference]: With dead ends: 178 [2022-07-13 22:58:47,478 INFO L226 Difference]: Without dead ends: 161 [2022-07-13 22:58:47,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:58:47,479 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 185 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:47,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 744 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 22:58:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-13 22:58:47,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 126. [2022-07-13 22:58:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 78 states have internal predecessors, (86), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 22:58:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2022-07-13 22:58:47,493 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 82 [2022-07-13 22:58:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:47,494 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2022-07-13 22:58:47,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 22:58:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2022-07-13 22:58:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-13 22:58:47,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:47,496 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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-13 22:58:47,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:58:47,497 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:47,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash -870191708, now seen corresponding path program 1 times [2022-07-13 22:58:47,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:47,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873479433] [2022-07-13 22:58:47,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:47,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:58:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:58:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:58:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:58:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:58:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:58:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:58:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-13 22:58:47,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:47,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873479433] [2022-07-13 22:58:47,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873479433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:47,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:47,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:58:47,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638825397] [2022-07-13 22:58:47,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:47,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:58:47,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:47,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:58:47,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:58:47,959 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-13 22:58:48,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:48,823 INFO L93 Difference]: Finished difference Result 206 states and 249 transitions. [2022-07-13 22:58:48,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:58:48,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2022-07-13 22:58:48,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:48,826 INFO L225 Difference]: With dead ends: 206 [2022-07-13 22:58:48,826 INFO L226 Difference]: Without dead ends: 151 [2022-07-13 22:58:48,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:58:48,827 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 159 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:48,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 464 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 22:58:48,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-13 22:58:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2022-07-13 22:58:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 81 states have (on average 1.1111111111111112) internal successors, (90), 82 states have internal predecessors, (90), 33 states have call successors, (33), 15 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2022-07-13 22:58:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2022-07-13 22:58:48,841 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 123 [2022-07-13 22:58:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:48,841 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2022-07-13 22:58:48,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-13 22:58:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2022-07-13 22:58:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-13 22:58:48,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:48,844 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:48,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:58:48,844 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:48,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:48,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1724885987, now seen corresponding path program 1 times [2022-07-13 22:58:48,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:48,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108425339] [2022-07-13 22:58:48,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:48,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:58:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:58:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:58:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:58:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:58:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:58:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 22:58:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-13 22:58:49,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:49,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108425339] [2022-07-13 22:58:49,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108425339] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:49,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:49,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 22:58:49,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509405772] [2022-07-13 22:58:49,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:49,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:58:49,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:49,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:58:49,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:58:49,247 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-13 22:58:50,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:50,156 INFO L93 Difference]: Finished difference Result 212 states and 257 transitions. [2022-07-13 22:58:50,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:58:50,157 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 129 [2022-07-13 22:58:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:50,158 INFO L225 Difference]: With dead ends: 212 [2022-07-13 22:58:50,158 INFO L226 Difference]: Without dead ends: 143 [2022-07-13 22:58:50,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:58:50,160 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 276 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:50,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 466 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 22:58:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-13 22:58:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2022-07-13 22:58:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 77 states have internal predecessors, (83), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-13 22:58:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2022-07-13 22:58:50,179 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 129 [2022-07-13 22:58:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:50,182 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2022-07-13 22:58:50,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-13 22:58:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2022-07-13 22:58:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-13 22:58:50,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:50,189 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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-13 22:58:50,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 22:58:50,189 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:50,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:50,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1745997560, now seen corresponding path program 1 times [2022-07-13 22:58:50,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:50,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019984978] [2022-07-13 22:58:50,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:50,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:58:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:58:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:58:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:58:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:58:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:50,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:51,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:51,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:58:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:51,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 22:58:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-13 22:58:51,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:51,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019984978] [2022-07-13 22:58:51,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019984978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:51,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:51,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-13 22:58:51,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622755843] [2022-07-13 22:58:51,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:51,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 22:58:51,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:51,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 22:58:51,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:58:51,158 INFO L87 Difference]: Start difference. First operand 124 states and 146 transitions. Second operand has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-07-13 22:58:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:53,323 INFO L93 Difference]: Finished difference Result 190 states and 229 transitions. [2022-07-13 22:58:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 22:58:53,324 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) Word has length 134 [2022-07-13 22:58:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:53,325 INFO L225 Difference]: With dead ends: 190 [2022-07-13 22:58:53,325 INFO L226 Difference]: Without dead ends: 143 [2022-07-13 22:58:53,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560 [2022-07-13 22:58:53,327 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 87 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:53,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1084 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-13 22:58:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-13 22:58:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-07-13 22:58:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 88 states have internal predecessors, (93), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2022-07-13 22:58:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 162 transitions. [2022-07-13 22:58:53,339 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 162 transitions. Word has length 134 [2022-07-13 22:58:53,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:53,339 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 162 transitions. [2022-07-13 22:58:53,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-07-13 22:58:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 162 transitions. [2022-07-13 22:58:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-13 22:58:53,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:53,341 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:53,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 22:58:53,342 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:53,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1524709556, now seen corresponding path program 1 times [2022-07-13 22:58:53,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:53,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512592153] [2022-07-13 22:58:53,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:53,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:58:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:58:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:58:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:58:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 22:58:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 22:58:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-13 22:58:53,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:53,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512592153] [2022-07-13 22:58:53,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512592153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:53,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:53,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 22:58:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882085644] [2022-07-13 22:58:53,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:53,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 22:58:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:53,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 22:58:53,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:58:53,731 INFO L87 Difference]: Start difference. First operand 137 states and 162 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-13 22:58:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:54,558 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2022-07-13 22:58:54,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:58:54,559 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2022-07-13 22:58:54,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:54,560 INFO L225 Difference]: With dead ends: 225 [2022-07-13 22:58:54,560 INFO L226 Difference]: Without dead ends: 119 [2022-07-13 22:58:54,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:58:54,561 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 91 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:54,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 478 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 22:58:54,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-13 22:58:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-13 22:58:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.082191780821918) internal successors, (79), 74 states have internal predecessors, (79), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-13 22:58:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2022-07-13 22:58:54,570 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 140 [2022-07-13 22:58:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:54,570 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2022-07-13 22:58:54,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-13 22:58:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-07-13 22:58:54,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 22:58:54,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:54,572 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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-13 22:58:54,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 22:58:54,573 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:54,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:54,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1517224244, now seen corresponding path program 1 times [2022-07-13 22:58:54,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:54,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605322064] [2022-07-13 22:58:54,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:54,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:58:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:58:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:58:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:58:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:58:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:54,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:58:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:55,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 22:58:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-13 22:58:55,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:55,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605322064] [2022-07-13 22:58:55,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605322064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:55,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:55,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:58:55,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816843026] [2022-07-13 22:58:55,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:55,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:58:55,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:55,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:58:55,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:58:55,017 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 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-13 22:58:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:55,710 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2022-07-13 22:58:55,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:58:55,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 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 135 [2022-07-13 22:58:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:55,711 INFO L225 Difference]: With dead ends: 166 [2022-07-13 22:58:55,712 INFO L226 Difference]: Without dead ends: 120 [2022-07-13 22:58:55,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:58:55,713 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 117 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:55,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 296 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 22:58:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-13 22:58:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-13 22:58:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 75 states have internal predecessors, (80), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-13 22:58:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2022-07-13 22:58:55,722 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 135 [2022-07-13 22:58:55,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:55,723 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2022-07-13 22:58:55,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 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-13 22:58:55,723 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2022-07-13 22:58:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 22:58:55,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:55,725 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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-13 22:58:55,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 22:58:55,725 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:55,726 INFO L85 PathProgramCache]: Analyzing trace with hash -473758278, now seen corresponding path program 1 times [2022-07-13 22:58:55,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:55,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053122401] [2022-07-13 22:58:55,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:55,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:58:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:58:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:58:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:58:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:58:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:58:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:58:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-07-13 22:58:56,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:56,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053122401] [2022-07-13 22:58:56,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053122401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:56,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051818541] [2022-07-13 22:58:56,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:56,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:56,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:56,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:56,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 22:58:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:57,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 2934 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-13 22:58:57,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:58,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:59:03,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:59:03,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:59:03,979 INFO L356 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2022-07-13 22:59:03,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 33 [2022-07-13 22:59:04,068 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-13 22:59:04,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-07-13 22:59:04,928 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-07-13 22:59:04,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-07-13 22:59:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-13 22:59:05,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:59:08,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051818541] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:59:08,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:59:08,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 37] total 57 [2022-07-13 22:59:08,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597792815] [2022-07-13 22:59:08,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:59:08,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-13 22:59:08,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:08,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-13 22:59:08,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=4118, Unknown=3, NotChecked=0, Total=4290 [2022-07-13 22:59:08,933 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-07-13 22:59:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:14,556 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-07-13 22:59:14,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-13 22:59:14,556 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) Word has length 136 [2022-07-13 22:59:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:14,557 INFO L225 Difference]: With dead ends: 174 [2022-07-13 22:59:14,557 INFO L226 Difference]: Without dead ends: 123 [2022-07-13 22:59:14,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=464, Invalid=9039, Unknown=3, NotChecked=0, Total=9506 [2022-07-13 22:59:14,562 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 223 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 4139 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 4605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 4139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:14,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1414 Invalid, 4605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 4139 Invalid, 0 Unknown, 221 Unchecked, 3.4s Time] [2022-07-13 22:59:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-13 22:59:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2022-07-13 22:59:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-13 22:59:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2022-07-13 22:59:14,572 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 136 [2022-07-13 22:59:14,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:14,573 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2022-07-13 22:59:14,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-07-13 22:59:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2022-07-13 22:59:14,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 22:59:14,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:14,575 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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-13 22:59:14,612 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-13 22:59:14,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 22:59:14,794 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:14,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1103785842, now seen corresponding path program 2 times [2022-07-13 22:59:14,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:14,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471967565] [2022-07-13 22:59:14,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:14,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:59:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:59:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:59:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:59:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:59:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:59:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:59:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:59:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:59:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:59:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:59:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:59:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:59:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:59:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 22:59:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-07-13 22:59:15,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:15,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471967565] [2022-07-13 22:59:15,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471967565] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:59:15,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572405518] [2022-07-13 22:59:15,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:59:15,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:59:15,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:59:15,900 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:59:15,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 22:59:16,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:59:16,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:59:16,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 3065 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-13 22:59:16,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:59:17,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:59:19,485 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1327_10| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_11| Int) (v_ArrVal_1294 Int) (v_ArrVal_1287 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_10| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_11|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_10| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1287) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_11| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1294)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1327_10|))) is different from true [2022-07-13 22:59:26,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:59:26,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:59:26,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:59:26,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:59:26,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:59:26,025 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-13 22:59:26,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 42 [2022-07-13 22:59:26,127 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-13 22:59:26,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2022-07-13 22:59:26,851 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-07-13 22:59:26,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 61 [2022-07-13 22:59:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 150 trivial. 2 not checked. [2022-07-13 22:59:26,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:59:33,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572405518] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:59:33,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:59:33,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 50 [2022-07-13 22:59:33,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543727617] [2022-07-13 22:59:33,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:59:33,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 22:59:33,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:33,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 22:59:33,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=3164, Unknown=3, NotChecked=112, Total=3422 [2022-07-13 22:59:33,748 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-13 22:59:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:47,837 INFO L93 Difference]: Finished difference Result 173 states and 205 transitions. [2022-07-13 22:59:47,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-13 22:59:47,838 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 137 [2022-07-13 22:59:47,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:47,839 INFO L225 Difference]: With dead ends: 173 [2022-07-13 22:59:47,839 INFO L226 Difference]: Without dead ends: 122 [2022-07-13 22:59:47,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=332, Invalid=6806, Unknown=6, NotChecked=166, Total=7310 [2022-07-13 22:59:47,842 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 101 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 3968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 901 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:47,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1650 Invalid, 3968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2956 Invalid, 0 Unknown, 901 Unchecked, 2.6s Time] [2022-07-13 22:59:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-13 22:59:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-13 22:59:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 77 states have internal predecessors, (82), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-13 22:59:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2022-07-13 22:59:47,851 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 137 [2022-07-13 22:59:47,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:47,852 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2022-07-13 22:59:47,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-13 22:59:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2022-07-13 22:59:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-13 22:59:47,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:47,853 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1] [2022-07-13 22:59:47,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 22:59:48,063 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,SelfDestructingSolverStorable10 [2022-07-13 22:59:48,064 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:48,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash 840196154, now seen corresponding path program 3 times [2022-07-13 22:59:48,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:48,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102781641] [2022-07-13 22:59:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:48,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:59:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:59:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:59:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:59:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:59:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:59:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:59:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:59:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:59:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:59:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:59:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:59:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:59:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:48,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:59:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:49,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 22:59:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-07-13 22:59:49,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:49,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102781641] [2022-07-13 22:59:49,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102781641] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:59:49,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620801320] [2022-07-13 22:59:49,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 22:59:49,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:59:49,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:59:49,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:59:49,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 22:59:51,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 22:59:51,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:59:51,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 2868 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-13 22:59:51,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:59:51,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:59:58,649 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1979 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_21| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_22| Int) (v_ArrVal_1963 Int) (v_ArrVal_1973 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_23| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_21| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1963) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_22| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1973) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_23| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1979))) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1327_21|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_21| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_22|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_22| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_23|))) is different from true [2022-07-13 23:00:07,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:07,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:07,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:07,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:07,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:07,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:07,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:07,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:07,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:07,148 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-13 23:00:07,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2022-07-13 23:00:07,219 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-13 23:00:07,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2022-07-13 23:00:07,884 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-07-13 23:00:07,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 61 [2022-07-13 23:00:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 3 refuted. 1 times theorem prover too weak. 150 trivial. 3 not checked. [2022-07-13 23:00:08,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:00:12,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620801320] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:00:12,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:00:12,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 52 [2022-07-13 23:00:12,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033824719] [2022-07-13 23:00:12,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:00:12,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-13 23:00:12,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:00:12,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-13 23:00:12,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=3391, Unknown=6, NotChecked=116, Total=3660 [2022-07-13 23:00:12,632 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-13 23:00:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:00:39,336 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-07-13 23:00:39,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-13 23:00:39,338 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 138 [2022-07-13 23:00:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:00:39,339 INFO L225 Difference]: With dead ends: 174 [2022-07-13 23:00:39,339 INFO L226 Difference]: Without dead ends: 123 [2022-07-13 23:00:39,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 43.5s TimeCoverageRelationStatistics Valid=338, Invalid=7310, Unknown=12, NotChecked=172, Total=7832 [2022-07-13 23:00:39,342 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 127 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 2982 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 4138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1017 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-13 23:00:39,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1734 Invalid, 4138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2982 Invalid, 0 Unknown, 1017 Unchecked, 2.7s Time] [2022-07-13 23:00:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-13 23:00:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-07-13 23:00:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 77 states have (on average 1.077922077922078) internal successors, (83), 78 states have internal predecessors, (83), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-13 23:00:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2022-07-13 23:00:39,353 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 138 [2022-07-13 23:00:39,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:00:39,353 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2022-07-13 23:00:39,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-13 23:00:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2022-07-13 23:00:39,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 23:00:39,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:00:39,355 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1] [2022-07-13 23:00:39,384 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-13 23:00:39,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:00:39,564 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:00:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:00:39,564 INFO L85 PathProgramCache]: Analyzing trace with hash 974095886, now seen corresponding path program 4 times [2022-07-13 23:00:39,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:00:39,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279072036] [2022-07-13 23:00:39,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:00:39,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:00:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 23:00:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 23:00:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 23:00:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 23:00:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:00:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 23:00:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 23:00:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:00:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:00:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 23:00:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 23:00:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:00:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 23:00:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 23:00:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 23:00:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-07-13 23:00:40,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:00:40,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279072036] [2022-07-13 23:00:40,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279072036] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:00:40,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621395968] [2022-07-13 23:00:40,955 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 23:00:40,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:00:40,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:00:40,957 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:00:40,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 23:00:43,329 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 23:00:43,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 23:00:43,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 3327 conjuncts, 159 conjunts are in the unsatisfiable core [2022-07-13 23:00:43,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:00:44,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 23:00:55,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:55,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:55,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:55,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:55,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:55,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:55,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:55,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:55,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:55,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:55,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:55,819 INFO L356 Elim1Store]: treesize reduction 82, result has 38.3 percent of original size [2022-07-13 23:00:55,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 72 [2022-07-13 23:00:55,949 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-13 23:00:55,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-07-13 23:00:56,757 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-07-13 23:00:56,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-07-13 23:00:56,925 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-13 23:00:56,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:01:02,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621395968] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:01:02,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:01:02,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 42] total 65 [2022-07-13 23:01:02,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405227900] [2022-07-13 23:01:02,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:01:02,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-13 23:01:02,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:01:02,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-13 23:01:02,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=5218, Unknown=2, NotChecked=0, Total=5402 [2022-07-13 23:01:02,377 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand has 65 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 48 states have internal predecessors, (121), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) [2022-07-13 23:01:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:01:22,001 INFO L93 Difference]: Finished difference Result 177 states and 209 transitions. [2022-07-13 23:01:22,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-13 23:01:22,002 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 48 states have internal predecessors, (121), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) Word has length 139 [2022-07-13 23:01:22,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:01:22,003 INFO L225 Difference]: With dead ends: 177 [2022-07-13 23:01:22,004 INFO L226 Difference]: Without dead ends: 126 [2022-07-13 23:01:22,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2029 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=486, Invalid=11720, Unknown=4, NotChecked=0, Total=12210 [2022-07-13 23:01:22,007 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 129 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 3982 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 4927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 3982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 801 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-13 23:01:22,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1674 Invalid, 4927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 3982 Invalid, 0 Unknown, 801 Unchecked, 3.9s Time] [2022-07-13 23:01:22,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-13 23:01:22,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2022-07-13 23:01:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 79 states have internal predecessors, (84), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-13 23:01:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2022-07-13 23:01:22,021 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 139 [2022-07-13 23:01:22,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:01:22,021 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2022-07-13 23:01:22,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 48 states have internal predecessors, (121), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) [2022-07-13 23:01:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2022-07-13 23:01:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-13 23:01:22,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:01:22,023 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 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-13 23:01:22,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 23:01:22,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:01:22,247 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:01:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:01:22,248 INFO L85 PathProgramCache]: Analyzing trace with hash 830020282, now seen corresponding path program 5 times [2022-07-13 23:01:22,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:01:22,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731544117] [2022-07-13 23:01:22,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:01:22,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:01:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:01:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 23:01:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 23:01:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:01:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 23:01:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 23:01:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:01:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 23:01:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 23:01:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:01:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:01:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:01:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:01:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:01:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 23:01:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:22,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 23:01:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:23,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:01:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:23,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:01:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:23,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 23:01:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:23,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:01:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:23,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 23:01:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:23,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 23:01:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-13 23:01:23,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:01:23,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731544117] [2022-07-13 23:01:23,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731544117] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:01:23,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855171185] [2022-07-13 23:01:23,859 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 23:01:23,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:01:23,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:01:23,861 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:01:23,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 23:01:50,906 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-13 23:01:50,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 23:01:50,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 3458 conjuncts, 260 conjunts are in the unsatisfiable core [2022-07-13 23:01:50,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:01:50,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:01:52,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:52,244 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-13 23:01:52,299 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-13 23:01:52,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:52,476 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-13 23:01:53,380 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 23:01:53,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 23:01:53,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 23:01:53,745 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3890 (Array Int Int)) (v_ArrVal_3899 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_48| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| 1) |c_#Ultimate.C_memcpy_#t~loopctr1327|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3890) |c_#Ultimate.C_memcpy_src.base|) |c_#Ultimate.C_memcpy_src.offset|)) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3899))) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1327_48|))) is different from true [2022-07-13 23:01:53,762 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3890 (Array Int Int)) (v_ArrVal_3899 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_49| Int) (v_ArrVal_3909 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_48| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3890) |c_#Ultimate.C_memcpy_src.base|) |c_#Ultimate.C_memcpy_src.offset|)) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3899) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_49| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3909)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_49|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_49| 1) |c_#Ultimate.C_memcpy_#t~loopctr1327|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1327_48|))) is different from true [2022-07-13 23:01:53,819 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3914 Int) (v_ArrVal_3890 (Array Int Int)) (v_ArrVal_3899 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_49| Int) (v_ArrVal_3909 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_48| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67|))) (and (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3890) |c_#Ultimate.C_memcpy_src.base|) |c_#Ultimate.C_memcpy_src.offset|)) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3899) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_49| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3909) (+ .cse0 |c_#Ultimate.C_memcpy_dest.offset| |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67|) v_ArrVal_3914)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_49| 1) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_49|) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67| 1) |c_#Ultimate.C_memcpy_#t~loopctr1327|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1327_48|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67|)))) is different from true [2022-07-13 23:01:53,927 WARN L855 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_memcpy_src.offset| Int) (v_ArrVal_3914 Int) (v_ArrVal_3890 (Array Int Int)) (v_ArrVal_3899 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67| Int) (v_ArrVal_3921 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_51| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_49| Int) (v_ArrVal_3909 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_48| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67|))) (and (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_51|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_49| 1) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_49|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (let ((.cse1 (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3890) |c_#Ultimate.C_memcpy_src.base|) |#Ultimate.C_memcpy_src.offset|)) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3899) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_49| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3909) (+ .cse0 |c_#Ultimate.C_memcpy_dest.offset| |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67|) v_ArrVal_3914)) (.cse2 (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_51| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse1 .cse2 (let ((.cse3 (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_51| |#Ultimate.C_memcpy_src.offset|))) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse1 .cse2 (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse1 .cse2 v_ArrVal_3921)) |c_#Ultimate.C_memcpy_src.base|) .cse3))) |c_#Ultimate.C_memcpy_src.base|) .cse3)))))) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1327_48|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_50_67|)))) is different from true [2022-07-13 23:01:55,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,289 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 23:01:55,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 16 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 81 [2022-07-13 23:01:55,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:55,511 INFO L356 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2022-07-13 23:01:55,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 74 [2022-07-13 23:01:59,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:59,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:00,099 INFO L356 Elim1Store]: treesize reduction 84, result has 63.3 percent of original size [2022-07-13 23:02:00,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 197 treesize of output 251 [2022-07-13 23:02:00,374 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 41 proven. 70 refuted. 0 times theorem prover too weak. 43 trivial. 14 not checked. [2022-07-13 23:02:00,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:02:10,408 WARN L233 SmtUtils]: Spent 8.38s on a formula simplification. DAG size of input: 208 DAG size of output: 206 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-13 23:02:16,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855171185] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:16,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:02:16,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 57] total 83 [2022-07-13 23:02:16,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795686706] [2022-07-13 23:02:16,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:02:16,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-07-13 23:02:16,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:16,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-07-13 23:02:16,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=7416, Unknown=12, NotChecked=700, Total=8372 [2022-07-13 23:02:16,317 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand has 83 states, 72 states have (on average 1.9166666666666667) internal successors, (138), 65 states have internal predecessors, (138), 22 states have call successors, (45), 12 states have call predecessors, (45), 20 states have return successors, (41), 26 states have call predecessors, (41), 21 states have call successors, (41) [2022-07-13 23:02:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:42,502 INFO L93 Difference]: Finished difference Result 185 states and 215 transitions. [2022-07-13 23:02:42,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-07-13 23:02:42,502 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 72 states have (on average 1.9166666666666667) internal successors, (138), 65 states have internal predecessors, (138), 22 states have call successors, (45), 12 states have call predecessors, (45), 20 states have return successors, (41), 26 states have call predecessors, (41), 21 states have call successors, (41) Word has length 140 [2022-07-13 23:02:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:42,504 INFO L225 Difference]: With dead ends: 185 [2022-07-13 23:02:42,504 INFO L226 Difference]: Without dead ends: 137 [2022-07-13 23:02:42,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 119 SyntacticMatches, 8 SemanticMatches, 138 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3661 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=697, Invalid=17651, Unknown=28, NotChecked=1084, Total=19460 [2022-07-13 23:02:42,506 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 120 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 5117 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 6970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 5117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1724 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:42,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1839 Invalid, 6970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 5117 Invalid, 0 Unknown, 1724 Unchecked, 4.2s Time] [2022-07-13 23:02:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-13 23:02:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2022-07-13 23:02:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 86 states have (on average 1.0813953488372092) internal successors, (93), 87 states have internal predecessors, (93), 31 states have call successors, (31), 16 states have call predecessors, (31), 16 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-13 23:02:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2022-07-13 23:02:42,536 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 140 [2022-07-13 23:02:42,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:42,538 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2022-07-13 23:02:42,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 72 states have (on average 1.9166666666666667) internal successors, (138), 65 states have internal predecessors, (138), 22 states have call successors, (45), 12 states have call predecessors, (45), 20 states have return successors, (41), 26 states have call predecessors, (41), 21 states have call successors, (41) [2022-07-13 23:02:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2022-07-13 23:02:42,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-13 23:02:42,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:42,541 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 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-13 23:02:42,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 23:02:42,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 23:02:42,760 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:42,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:42,760 INFO L85 PathProgramCache]: Analyzing trace with hash 658643854, now seen corresponding path program 6 times [2022-07-13 23:02:42,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:42,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385104132] [2022-07-13 23:02:42,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:42,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 23:02:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 23:02:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 23:02:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 23:02:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:02:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 23:02:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 23:02:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:02:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:02:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 23:02:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 23:02:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:02:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 23:02:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:43,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 23:02:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat