This is Ultimate 0.2.4-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 20:10:12,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 20:10:13,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 20:10:13,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 20:10:13,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 20:10:13,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 20:10:13,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 20:10:13,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 20:10:13,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 20:10:13,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 20:10:13,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 20:10:13,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 20:10:13,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 20:10:13,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 20:10:13,067 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 20:10:13,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 20:10:13,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 20:10:13,068 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 20:10:13,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 20:10:13,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 20:10:13,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 20:10:13,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 20:10:13,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 20:10:13,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 20:10:13,076 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 20:10:13,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 20:10:13,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 20:10:13,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 20:10:13,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 20:10:13,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 20:10:13,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 20:10:13,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 20:10:13,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:10:13,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 20:10:13,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 20:10:13,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 20:10:13,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 20:10:13,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 20:10:13,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 20:10:13,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 20:10:13,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 20:10:13,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 20:10:13,087 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/certificate-witnesses-artifact/automizer/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.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-15 20:10:13,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 20:10:13,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 20:10:13,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 20:10:13,646 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 20:10:13,647 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 20:10:13,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2024-09-15 20:10:15,129 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 20:10:15,373 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 20:10:15,374 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2024-09-15 20:10:15,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d3e04744a/85313e1c17284508bbf5220596635ea5/FLAG0fe9ff0de [2024-09-15 20:10:15,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d3e04744a/85313e1c17284508bbf5220596635ea5 [2024-09-15 20:10:15,404 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-15 20:10:15,406 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-15 20:10:15,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/apache-escape-absolute.i.v+cfa-reducer.yml/witness-2.1.yml [2024-09-15 20:10:15,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 20:10:15,484 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-15 20:10:15,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 20:10:15,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 20:10:15,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 20:10:15,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:10:15" (1/2) ... [2024-09-15 20:10:15,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf747eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:15, skipping insertion in model container [2024-09-15 20:10:15,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:10:15" (1/2) ... [2024-09-15 20:10:15,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5cb5b938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:15, skipping insertion in model container [2024-09-15 20:10:15,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:10:15" (2/2) ... [2024-09-15 20:10:15,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf747eb and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:15, skipping insertion in model container [2024-09-15 20:10:15,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:10:15" (2/2) ... [2024-09-15 20:10:15,518 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-15 20:10:15,519 INFO L1541 ArrayList]: Location invariant before [L262-L328] ((\old(__return_375) == __return_375) && ((((((long long) main__cp + 2) <= main__urilen) && (main__c == 0)) && (1 <= main__cp)) || (((((long long) main__cp + 2) <= main__urilen) && (1 <= main__c)) && (1 <= main__cp)))) [2024-09-15 20:10:15,519 INFO L1541 ArrayList]: Location invariant before [L131-L402] ((((((long long) main__cp + 1) <= main__urilen) && (\old(__return_375) == __return_375)) && (1 <= main__cp))) && (((((main__urilen == ((long long) main__cp + 1)) && (\old(__return_375) == __return_375)) && (1 <= main__cp)) || (((((long long) main__cp + 2) <= main__urilen) && (\old(__return_375) == __return_375)) && (1 <= main__cp)))) [2024-09-15 20:10:15,519 INFO L1541 ArrayList]: Location invariant before [L162-L359] (\old(__return_375) == __return_375) [2024-09-15 20:10:15,519 INFO L1541 ArrayList]: Location invariant before [L232-L343] (((((long long) main__cp + 1) <= main__urilen) && (\old(__return_375) == __return_375)) && (((1 <= main__c) && (1 <= main__cp)) || ((main__c == 0) && (1 <= main__cp)))) [2024-09-15 20:10:15,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 20:10:15,712 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2024-09-15 20:10:15,723 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2024-09-15 20:10:15,724 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2024-09-15 20:10:15,727 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2024-09-15 20:10:15,730 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2024-09-15 20:10:15,735 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2024-09-15 20:10:15,737 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2024-09-15 20:10:15,738 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2024-09-15 20:10:15,741 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2024-09-15 20:10:15,744 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2024-09-15 20:10:15,746 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2024-09-15 20:10:15,748 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2024-09-15 20:10:15,750 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2024-09-15 20:10:15,753 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2024-09-15 20:10:15,755 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2024-09-15 20:10:15,759 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2024-09-15 20:10:15,762 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2024-09-15 20:10:15,767 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2024-09-15 20:10:15,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:10:15,786 INFO L200 MainTranslator]: Completed pre-run [2024-09-15 20:10:15,801 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2024-09-15 20:10:15,802 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2024-09-15 20:10:15,804 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2024-09-15 20:10:15,806 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2024-09-15 20:10:15,810 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2024-09-15 20:10:15,811 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2024-09-15 20:10:15,812 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2024-09-15 20:10:15,817 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2024-09-15 20:10:15,818 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2024-09-15 20:10:15,821 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2024-09-15 20:10:15,823 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2024-09-15 20:10:15,826 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2024-09-15 20:10:15,828 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2024-09-15 20:10:15,829 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2024-09-15 20:10:15,834 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2024-09-15 20:10:15,835 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-15 20:10:15,864 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2024-09-15 20:10:15,865 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] Start Parsing Local [2024-09-15 20:10:15,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:10:15,884 INFO L204 MainTranslator]: Completed translation [2024-09-15 20:10:15,885 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:15 WrapperNode [2024-09-15 20:10:15,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 20:10:15,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 20:10:15,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 20:10:15,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 20:10:15,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:15" (1/1) ... [2024-09-15 20:10:15,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:15" (1/1) ... [2024-09-15 20:10:15,927 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 290 [2024-09-15 20:10:15,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 20:10:15,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 20:10:15,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 20:10:15,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 20:10:15,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:15" (1/1) ... [2024-09-15 20:10:15,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:15" (1/1) ... [2024-09-15 20:10:15,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:15" (1/1) ... [2024-09-15 20:10:15,983 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-15 20:10:15,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:15" (1/1) ... [2024-09-15 20:10:15,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:15" (1/1) ... [2024-09-15 20:10:15,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:15" (1/1) ... [2024-09-15 20:10:16,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:15" (1/1) ... [2024-09-15 20:10:16,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:15" (1/1) ... [2024-09-15 20:10:16,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:15" (1/1) ... [2024-09-15 20:10:16,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 20:10:16,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 20:10:16,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 20:10:16,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 20:10:16,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:15" (1/1) ... [2024-09-15 20:10:16,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:10:16,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:10:16,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-15 20:10:16,092 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-15 20:10:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 20:10:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-15 20:10:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 20:10:16,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 20:10:16,201 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 20:10:16,203 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 20:10:16,508 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-09-15 20:10:16,508 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 20:10:16,531 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 20:10:16,531 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-15 20:10:16,532 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:10:16 BoogieIcfgContainer [2024-09-15 20:10:16,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 20:10:16,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 20:10:16,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 20:10:16,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 20:10:16,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 08:10:15" (1/4) ... [2024-09-15 20:10:16,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1d4255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:10:16, skipping insertion in model container [2024-09-15 20:10:16,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:10:15" (2/4) ... [2024-09-15 20:10:16,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1d4255 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 15.09 08:10:16, skipping insertion in model container [2024-09-15 20:10:16,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:15" (3/4) ... [2024-09-15 20:10:16,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1d4255 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 15.09 08:10:16, skipping insertion in model container [2024-09-15 20:10:16,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:10:16" (4/4) ... [2024-09-15 20:10:16,543 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2024-09-15 20:10:16,555 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 20:10:16,555 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-09-15 20:10:16,590 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 20:10:16,595 INFO L336 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7367325c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 20:10:16,595 INFO L337 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-09-15 20:10:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 65 states have (on average 1.9230769230769231) internal successors, (125), 87 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-15 20:10:16,603 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:16,603 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:16,604 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:16,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:16,608 INFO L85 PathProgramCache]: Analyzing trace with hash 926337663, now seen corresponding path program 1 times [2024-09-15 20:10:16,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:16,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171465025] [2024-09-15 20:10:16,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:16,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:16,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:16,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171465025] [2024-09-15 20:10:16,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171465025] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:16,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:16,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:16,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783577337] [2024-09-15 20:10:16,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:16,849 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:10:16,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:16,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:10:16,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:10:16,872 INFO L87 Difference]: Start difference. First operand has 88 states, 65 states have (on average 1.9230769230769231) internal successors, (125), 87 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:16,907 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2024-09-15 20:10:16,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:10:16,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-09-15 20:10:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:16,914 INFO L225 Difference]: With dead ends: 86 [2024-09-15 20:10:16,915 INFO L226 Difference]: Without dead ends: 83 [2024-09-15 20:10:16,916 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:10:16,920 INFO L434 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:16,921 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:10:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-15 20:10:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-09-15 20:10:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 82 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2024-09-15 20:10:16,947 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 14 [2024-09-15 20:10:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:16,947 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2024-09-15 20:10:16,947 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2024-09-15 20:10:16,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-15 20:10:16,948 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:16,948 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:16,948 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 20:10:16,948 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:16,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:16,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1348299427, now seen corresponding path program 1 times [2024-09-15 20:10:16,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:16,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455657009] [2024-09-15 20:10:16,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:16,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:17,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:17,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455657009] [2024-09-15 20:10:17,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455657009] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:17,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:17,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-15 20:10:17,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832786202] [2024-09-15 20:10:17,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:17,043 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 20:10:17,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:17,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 20:10:17,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:17,044 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:17,154 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2024-09-15 20:10:17,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 20:10:17,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-09-15 20:10:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:17,155 INFO L225 Difference]: With dead ends: 81 [2024-09-15 20:10:17,155 INFO L226 Difference]: Without dead ends: 81 [2024-09-15 20:10:17,156 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-15 20:10:17,156 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 66 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:17,157 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 159 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-15 20:10:17,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-09-15 20:10:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-09-15 20:10:17,165 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 15 [2024-09-15 20:10:17,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:17,166 INFO L474 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-09-15 20:10:17,166 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-09-15 20:10:17,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-15 20:10:17,168 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:17,168 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:17,169 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 20:10:17,169 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:17,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:17,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1364501248, now seen corresponding path program 1 times [2024-09-15 20:10:17,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:17,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354748030] [2024-09-15 20:10:17,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:17,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:17,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:17,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354748030] [2024-09-15 20:10:17,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354748030] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:17,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:17,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:17,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879261583] [2024-09-15 20:10:17,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:17,318 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:17,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:17,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:17,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:17,320 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:17,402 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-09-15 20:10:17,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:17,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-09-15 20:10:17,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:17,403 INFO L225 Difference]: With dead ends: 80 [2024-09-15 20:10:17,403 INFO L226 Difference]: Without dead ends: 80 [2024-09-15 20:10:17,404 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:17,405 INFO L434 NwaCegarLoop]: 54 mSDtfsCounter, 54 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:17,405 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 120 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-15 20:10:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-09-15 20:10:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-09-15 20:10:17,410 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 17 [2024-09-15 20:10:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:17,410 INFO L474 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-09-15 20:10:17,410 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-09-15 20:10:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-15 20:10:17,411 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:17,411 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:17,411 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-15 20:10:17,411 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:17,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:17,412 INFO L85 PathProgramCache]: Analyzing trace with hash -650129860, now seen corresponding path program 1 times [2024-09-15 20:10:17,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:17,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651218610] [2024-09-15 20:10:17,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:17,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:17,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:17,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651218610] [2024-09-15 20:10:17,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651218610] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:17,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:17,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:17,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223241241] [2024-09-15 20:10:17,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:17,526 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 20:10:17,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:17,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 20:10:17,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:17,527 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:17,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:17,588 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2024-09-15 20:10:17,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 20:10:17,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-09-15 20:10:17,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:17,590 INFO L225 Difference]: With dead ends: 79 [2024-09-15 20:10:17,590 INFO L226 Difference]: Without dead ends: 79 [2024-09-15 20:10:17,591 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:17,592 INFO L434 NwaCegarLoop]: 52 mSDtfsCounter, 60 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:17,592 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 112 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:17,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-09-15 20:10:17,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-09-15 20:10:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-09-15 20:10:17,597 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 18 [2024-09-15 20:10:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:17,597 INFO L474 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-09-15 20:10:17,597 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:17,598 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-09-15 20:10:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-15 20:10:17,598 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:17,598 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:17,598 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-15 20:10:17,598 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:17,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash -650130163, now seen corresponding path program 1 times [2024-09-15 20:10:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:17,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603992098] [2024-09-15 20:10:17,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:17,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:17,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:17,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603992098] [2024-09-15 20:10:17,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603992098] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:17,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:17,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:17,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672462840] [2024-09-15 20:10:17,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:17,649 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:17,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:17,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:17,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:17,650 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:17,711 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2024-09-15 20:10:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:17,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-09-15 20:10:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:17,712 INFO L225 Difference]: With dead ends: 77 [2024-09-15 20:10:17,712 INFO L226 Difference]: Without dead ends: 77 [2024-09-15 20:10:17,712 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:17,713 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 58 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:17,713 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 147 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:17,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-09-15 20:10:17,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-09-15 20:10:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2024-09-15 20:10:17,717 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 18 [2024-09-15 20:10:17,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:17,717 INFO L474 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2024-09-15 20:10:17,717 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:17,718 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2024-09-15 20:10:17,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-15 20:10:17,718 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:17,718 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:17,718 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-15 20:10:17,718 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:17,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:17,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2087966346, now seen corresponding path program 1 times [2024-09-15 20:10:17,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:17,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119502044] [2024-09-15 20:10:17,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:17,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:17,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119502044] [2024-09-15 20:10:17,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119502044] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:17,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:17,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:17,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349877823] [2024-09-15 20:10:17,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:17,778 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:17,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:17,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:17,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:17,779 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:17,849 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-09-15 20:10:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:17,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-09-15 20:10:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:17,850 INFO L225 Difference]: With dead ends: 75 [2024-09-15 20:10:17,850 INFO L226 Difference]: Without dead ends: 75 [2024-09-15 20:10:17,851 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-15 20:10:17,851 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 47 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:17,852 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 156 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:17,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-09-15 20:10:17,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-09-15 20:10:17,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-09-15 20:10:17,855 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 22 [2024-09-15 20:10:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:17,855 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-09-15 20:10:17,855 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-09-15 20:10:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-15 20:10:17,856 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:17,856 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:17,856 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-15 20:10:17,856 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:17,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:17,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2083539399, now seen corresponding path program 1 times [2024-09-15 20:10:17,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:17,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896534109] [2024-09-15 20:10:17,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:17,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:17,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:17,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:17,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896534109] [2024-09-15 20:10:17,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896534109] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:17,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:17,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:17,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758209332] [2024-09-15 20:10:17,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:17,934 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:17,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:17,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:17,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:17,935 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:18,010 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2024-09-15 20:10:18,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:18,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-09-15 20:10:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:18,011 INFO L225 Difference]: With dead ends: 73 [2024-09-15 20:10:18,011 INFO L226 Difference]: Without dead ends: 73 [2024-09-15 20:10:18,011 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-15 20:10:18,012 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 45 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:18,012 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 150 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-15 20:10:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-09-15 20:10:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-09-15 20:10:18,016 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 22 [2024-09-15 20:10:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:18,019 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-09-15 20:10:18,019 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-09-15 20:10:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-15 20:10:18,019 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:18,019 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:18,019 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-15 20:10:18,019 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:18,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash 302451421, now seen corresponding path program 1 times [2024-09-15 20:10:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:18,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935006014] [2024-09-15 20:10:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:18,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:18,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:18,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935006014] [2024-09-15 20:10:18,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935006014] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:18,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:18,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:18,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695636110] [2024-09-15 20:10:18,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:18,085 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:18,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:18,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:18,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:18,088 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:18,145 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-09-15 20:10:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:18,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-09-15 20:10:18,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:18,147 INFO L225 Difference]: With dead ends: 71 [2024-09-15 20:10:18,147 INFO L226 Difference]: Without dead ends: 71 [2024-09-15 20:10:18,148 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:18,148 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 47 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:18,148 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 142 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-15 20:10:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-09-15 20:10:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-09-15 20:10:18,151 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 23 [2024-09-15 20:10:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:18,151 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-09-15 20:10:18,151 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-09-15 20:10:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-15 20:10:18,152 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:18,152 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:18,152 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-15 20:10:18,152 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:18,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:18,153 INFO L85 PathProgramCache]: Analyzing trace with hash 165216341, now seen corresponding path program 1 times [2024-09-15 20:10:18,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:18,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544380398] [2024-09-15 20:10:18,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:18,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:18,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:18,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544380398] [2024-09-15 20:10:18,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544380398] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:18,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:18,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:18,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567145841] [2024-09-15 20:10:18,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:18,264 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 20:10:18,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:18,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 20:10:18,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:18,264 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:18,334 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-09-15 20:10:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 20:10:18,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-09-15 20:10:18,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:18,335 INFO L225 Difference]: With dead ends: 100 [2024-09-15 20:10:18,335 INFO L226 Difference]: Without dead ends: 100 [2024-09-15 20:10:18,335 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-09-15 20:10:18,335 INFO L434 NwaCegarLoop]: 58 mSDtfsCounter, 144 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:18,336 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 79 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-09-15 20:10:18,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 69. [2024-09-15 20:10:18,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-09-15 20:10:18,338 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 23 [2024-09-15 20:10:18,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:18,339 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-09-15 20:10:18,339 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-09-15 20:10:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-15 20:10:18,339 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:18,339 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:18,340 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-15 20:10:18,340 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:18,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash 165216196, now seen corresponding path program 1 times [2024-09-15 20:10:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:18,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009856192] [2024-09-15 20:10:18,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:18,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:18,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:18,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009856192] [2024-09-15 20:10:18,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009856192] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:18,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:18,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:18,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123636761] [2024-09-15 20:10:18,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:18,398 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:18,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:18,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:18,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:18,399 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:18,452 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2024-09-15 20:10:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:18,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-09-15 20:10:18,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:18,453 INFO L225 Difference]: With dead ends: 67 [2024-09-15 20:10:18,453 INFO L226 Difference]: Without dead ends: 67 [2024-09-15 20:10:18,453 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:18,454 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 45 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:18,455 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 139 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:10:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-15 20:10:18,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-09-15 20:10:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2024-09-15 20:10:18,461 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 23 [2024-09-15 20:10:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:18,462 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2024-09-15 20:10:18,462 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2024-09-15 20:10:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-15 20:10:18,463 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:18,463 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:18,463 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-15 20:10:18,463 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:18,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:18,464 INFO L85 PathProgramCache]: Analyzing trace with hash -502585664, now seen corresponding path program 1 times [2024-09-15 20:10:18,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:18,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879101957] [2024-09-15 20:10:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:18,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:18,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:18,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879101957] [2024-09-15 20:10:18,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879101957] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:18,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:18,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431080348] [2024-09-15 20:10:18,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:18,489 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:10:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:18,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:10:18,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:10:18,490 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:18,549 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2024-09-15 20:10:18,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:10:18,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-09-15 20:10:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:18,553 INFO L225 Difference]: With dead ends: 72 [2024-09-15 20:10:18,553 INFO L226 Difference]: Without dead ends: 67 [2024-09-15 20:10:18,553 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:10:18,553 INFO L434 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:18,554 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-15 20:10:18,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-09-15 20:10:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 66 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2024-09-15 20:10:18,556 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 26 [2024-09-15 20:10:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:18,556 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2024-09-15 20:10:18,556 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2024-09-15 20:10:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-15 20:10:18,556 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:18,557 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:18,557 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-15 20:10:18,557 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:18,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:18,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1814894741, now seen corresponding path program 1 times [2024-09-15 20:10:18,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:18,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387599677] [2024-09-15 20:10:18,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:18,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:18,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:18,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387599677] [2024-09-15 20:10:18,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387599677] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:18,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:18,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:18,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194875679] [2024-09-15 20:10:18,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:18,641 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:18,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:18,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:18,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:18,641 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:18,741 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2024-09-15 20:10:18,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:18,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-09-15 20:10:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:18,742 INFO L225 Difference]: With dead ends: 67 [2024-09-15 20:10:18,742 INFO L226 Difference]: Without dead ends: 67 [2024-09-15 20:10:18,742 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:18,743 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 83 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:18,743 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 89 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:18,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-15 20:10:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2024-09-15 20:10:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 64 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2024-09-15 20:10:18,744 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 27 [2024-09-15 20:10:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:18,744 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2024-09-15 20:10:18,745 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2024-09-15 20:10:18,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-15 20:10:18,745 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:18,745 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:18,746 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-15 20:10:18,746 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:18,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:18,746 INFO L85 PathProgramCache]: Analyzing trace with hash 427166282, now seen corresponding path program 1 times [2024-09-15 20:10:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:18,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116546100] [2024-09-15 20:10:18,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:18,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:18,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:18,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116546100] [2024-09-15 20:10:18,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116546100] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:18,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:18,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:18,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10098580] [2024-09-15 20:10:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:18,804 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:18,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:18,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:18,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:18,804 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:18,885 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2024-09-15 20:10:18,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:18,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-09-15 20:10:18,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:18,886 INFO L225 Difference]: With dead ends: 64 [2024-09-15 20:10:18,886 INFO L226 Difference]: Without dead ends: 64 [2024-09-15 20:10:18,886 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:18,886 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:18,887 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 92 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-15 20:10:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-09-15 20:10:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 62 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2024-09-15 20:10:18,888 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 28 [2024-09-15 20:10:18,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:18,889 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2024-09-15 20:10:18,889 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2024-09-15 20:10:18,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-15 20:10:18,889 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:18,889 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:18,890 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-15 20:10:18,890 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:18,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:18,890 INFO L85 PathProgramCache]: Analyzing trace with hash -273319457, now seen corresponding path program 1 times [2024-09-15 20:10:18,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:18,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900595119] [2024-09-15 20:10:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:18,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:18,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:18,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900595119] [2024-09-15 20:10:18,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900595119] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:18,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:18,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:18,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545978792] [2024-09-15 20:10:18,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:18,987 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:18,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:18,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:18,988 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:19,089 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2024-09-15 20:10:19,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:19,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-09-15 20:10:19,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:19,090 INFO L225 Difference]: With dead ends: 63 [2024-09-15 20:10:19,091 INFO L226 Difference]: Without dead ends: 63 [2024-09-15 20:10:19,091 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:19,091 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 37 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:19,092 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:19,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-15 20:10:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2024-09-15 20:10:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2024-09-15 20:10:19,095 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 31 [2024-09-15 20:10:19,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:19,095 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2024-09-15 20:10:19,095 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,095 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2024-09-15 20:10:19,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-15 20:10:19,096 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:19,096 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:19,098 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-15 20:10:19,098 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:19,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:19,098 INFO L85 PathProgramCache]: Analyzing trace with hash 117035606, now seen corresponding path program 1 times [2024-09-15 20:10:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:19,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423517559] [2024-09-15 20:10:19,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:19,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:19,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:19,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423517559] [2024-09-15 20:10:19,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423517559] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:19,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:19,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594766297] [2024-09-15 20:10:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:19,178 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:19,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:19,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:19,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:19,178 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:19,229 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2024-09-15 20:10:19,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:19,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-09-15 20:10:19,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:19,230 INFO L225 Difference]: With dead ends: 72 [2024-09-15 20:10:19,230 INFO L226 Difference]: Without dead ends: 72 [2024-09-15 20:10:19,230 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:19,231 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 66 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:19,231 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 93 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:10:19,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-15 20:10:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2024-09-15 20:10:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2024-09-15 20:10:19,233 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 32 [2024-09-15 20:10:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:19,233 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2024-09-15 20:10:19,233 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,233 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2024-09-15 20:10:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-15 20:10:19,234 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:19,234 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:19,234 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-15 20:10:19,234 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:19,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash 117035835, now seen corresponding path program 1 times [2024-09-15 20:10:19,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:19,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825903228] [2024-09-15 20:10:19,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:19,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:19,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:19,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825903228] [2024-09-15 20:10:19,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825903228] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:19,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:19,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:19,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905846978] [2024-09-15 20:10:19,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:19,371 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-15 20:10:19,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:19,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-15 20:10:19,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-09-15 20:10:19,371 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:19,489 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2024-09-15 20:10:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-15 20:10:19,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-09-15 20:10:19,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:19,490 INFO L225 Difference]: With dead ends: 86 [2024-09-15 20:10:19,490 INFO L226 Difference]: Without dead ends: 86 [2024-09-15 20:10:19,491 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2024-09-15 20:10:19,491 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 145 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:19,491 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 81 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:19,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-15 20:10:19,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2024-09-15 20:10:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-09-15 20:10:19,493 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 32 [2024-09-15 20:10:19,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:19,493 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-09-15 20:10:19,493 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,493 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-09-15 20:10:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-15 20:10:19,494 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:19,494 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:19,494 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-15 20:10:19,494 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:19,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:19,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2089713280, now seen corresponding path program 1 times [2024-09-15 20:10:19,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:19,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262780664] [2024-09-15 20:10:19,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:19,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:19,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:19,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262780664] [2024-09-15 20:10:19,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262780664] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:19,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:19,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:19,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174832216] [2024-09-15 20:10:19,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:19,553 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:19,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:19,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:19,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:19,554 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:19,621 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2024-09-15 20:10:19,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:19,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-09-15 20:10:19,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:19,622 INFO L225 Difference]: With dead ends: 67 [2024-09-15 20:10:19,622 INFO L226 Difference]: Without dead ends: 67 [2024-09-15 20:10:19,622 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:19,623 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 37 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:19,623 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 101 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-15 20:10:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2024-09-15 20:10:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-09-15 20:10:19,625 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 36 [2024-09-15 20:10:19,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:19,625 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-09-15 20:10:19,625 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-09-15 20:10:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-15 20:10:19,626 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:19,626 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:19,626 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-15 20:10:19,626 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:19,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:19,627 INFO L85 PathProgramCache]: Analyzing trace with hash -356598035, now seen corresponding path program 1 times [2024-09-15 20:10:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:19,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298345832] [2024-09-15 20:10:19,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:19,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:19,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:19,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298345832] [2024-09-15 20:10:19,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298345832] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:19,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:19,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:19,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571603620] [2024-09-15 20:10:19,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:19,691 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:19,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:19,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:19,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:19,691 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:19,760 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2024-09-15 20:10:19,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:19,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-09-15 20:10:19,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:19,761 INFO L225 Difference]: With dead ends: 64 [2024-09-15 20:10:19,761 INFO L226 Difference]: Without dead ends: 64 [2024-09-15 20:10:19,761 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-15 20:10:19,762 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:19,762 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 101 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-15 20:10:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-09-15 20:10:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2024-09-15 20:10:19,763 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 37 [2024-09-15 20:10:19,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:19,763 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2024-09-15 20:10:19,763 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2024-09-15 20:10:19,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-15 20:10:19,764 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:19,764 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:19,764 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-15 20:10:19,765 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:19,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1951498758, now seen corresponding path program 1 times [2024-09-15 20:10:19,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:19,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943102305] [2024-09-15 20:10:19,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:19,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:19,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:19,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943102305] [2024-09-15 20:10:19,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943102305] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:19,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:19,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:19,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848347814] [2024-09-15 20:10:19,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:19,826 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:19,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:19,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:19,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:19,827 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:19,851 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-09-15 20:10:19,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:19,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-09-15 20:10:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:19,852 INFO L225 Difference]: With dead ends: 68 [2024-09-15 20:10:19,852 INFO L226 Difference]: Without dead ends: 68 [2024-09-15 20:10:19,852 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:19,853 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:19,853 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 132 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:10:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-15 20:10:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2024-09-15 20:10:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2024-09-15 20:10:19,854 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 40 [2024-09-15 20:10:19,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:19,855 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2024-09-15 20:10:19,855 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2024-09-15 20:10:19,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-15 20:10:19,855 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:19,855 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:19,855 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-15 20:10:19,856 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:19,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:19,856 INFO L85 PathProgramCache]: Analyzing trace with hash -366915129, now seen corresponding path program 1 times [2024-09-15 20:10:19,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:19,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701712053] [2024-09-15 20:10:19,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:19,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:19,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:19,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701712053] [2024-09-15 20:10:19,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701712053] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:19,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:19,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:19,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201895416] [2024-09-15 20:10:19,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:19,914 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:19,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:19,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:19,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:19,914 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:19,950 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2024-09-15 20:10:19,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:19,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-09-15 20:10:19,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:19,951 INFO L225 Difference]: With dead ends: 59 [2024-09-15 20:10:19,951 INFO L226 Difference]: Without dead ends: 59 [2024-09-15 20:10:19,951 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:19,951 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 18 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:19,951 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 168 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:10:19,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-15 20:10:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-15 20:10:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2024-09-15 20:10:19,953 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 41 [2024-09-15 20:10:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:19,953 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2024-09-15 20:10:19,953 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2024-09-15 20:10:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-15 20:10:19,953 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:19,953 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:19,953 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-15 20:10:19,953 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:19,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1510537121, now seen corresponding path program 1 times [2024-09-15 20:10:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:19,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288632224] [2024-09-15 20:10:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:19,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:20,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:20,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288632224] [2024-09-15 20:10:20,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288632224] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:20,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:20,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:20,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271718880] [2024-09-15 20:10:20,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:20,018 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:20,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:20,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:20,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:20,019 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:20,096 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2024-09-15 20:10:20,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:20,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-09-15 20:10:20,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:20,097 INFO L225 Difference]: With dead ends: 59 [2024-09-15 20:10:20,097 INFO L226 Difference]: Without dead ends: 59 [2024-09-15 20:10:20,097 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:20,098 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:20,098 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 77 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-15 20:10:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-09-15 20:10:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2024-09-15 20:10:20,101 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 42 [2024-09-15 20:10:20,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:20,101 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2024-09-15 20:10:20,101 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2024-09-15 20:10:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-15 20:10:20,101 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:20,101 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:20,102 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-15 20:10:20,102 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:20,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:20,102 INFO L85 PathProgramCache]: Analyzing trace with hash -417985266, now seen corresponding path program 1 times [2024-09-15 20:10:20,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:20,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574864250] [2024-09-15 20:10:20,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:20,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:20,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:20,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574864250] [2024-09-15 20:10:20,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574864250] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:20,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:20,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:20,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671371552] [2024-09-15 20:10:20,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:20,180 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:20,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:20,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:20,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:20,181 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:20,249 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2024-09-15 20:10:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:20,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-09-15 20:10:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:20,250 INFO L225 Difference]: With dead ends: 56 [2024-09-15 20:10:20,251 INFO L226 Difference]: Without dead ends: 56 [2024-09-15 20:10:20,252 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-15 20:10:20,252 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:20,252 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 77 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:20,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-15 20:10:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-09-15 20:10:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2024-09-15 20:10:20,253 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 43 [2024-09-15 20:10:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:20,254 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2024-09-15 20:10:20,254 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:20,254 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2024-09-15 20:10:20,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-15 20:10:20,254 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:20,255 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:20,255 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-15 20:10:20,255 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-09-15 20:10:20,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:20,255 INFO L85 PathProgramCache]: Analyzing trace with hash -72637103, now seen corresponding path program 1 times [2024-09-15 20:10:20,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:20,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980527389] [2024-09-15 20:10:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:20,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:20,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:20,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980527389] [2024-09-15 20:10:20,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980527389] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:10:20,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429421280] [2024-09-15 20:10:20,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:20,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:10:20,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:10:20,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 20:10:20,454 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-15 20:10:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:20,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-15 20:10:20,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:10:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:20,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:10:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:21,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429421280] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-15 20:10:21,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-15 20:10:21,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 15 [2024-09-15 20:10:21,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122663366] [2024-09-15 20:10:21,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:21,224 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 20:10:21,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:21,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 20:10:21,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2024-09-15 20:10:21,225 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:21,329 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2024-09-15 20:10:21,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:21,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-09-15 20:10:21,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:21,330 INFO L225 Difference]: With dead ends: 54 [2024-09-15 20:10:21,330 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 20:10:21,330 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2024-09-15 20:10:21,331 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:21,332 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 60 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 20:10:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 20:10:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 20:10:21,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2024-09-15 20:10:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:21,332 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 20:10:21,332 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 20:10:21,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 20:10:21,335 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (21 of 22 remaining) [2024-09-15 20:10:21,335 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (20 of 22 remaining) [2024-09-15 20:10:21,335 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (19 of 22 remaining) [2024-09-15 20:10:21,336 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (18 of 22 remaining) [2024-09-15 20:10:21,336 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 22 remaining) [2024-09-15 20:10:21,336 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (16 of 22 remaining) [2024-09-15 20:10:21,336 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (15 of 22 remaining) [2024-09-15 20:10:21,336 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 22 remaining) [2024-09-15 20:10:21,336 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (13 of 22 remaining) [2024-09-15 20:10:21,336 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (12 of 22 remaining) [2024-09-15 20:10:21,337 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (11 of 22 remaining) [2024-09-15 20:10:21,337 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (10 of 22 remaining) [2024-09-15 20:10:21,337 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 22 remaining) [2024-09-15 20:10:21,338 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (8 of 22 remaining) [2024-09-15 20:10:21,338 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (7 of 22 remaining) [2024-09-15 20:10:21,338 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 22 remaining) [2024-09-15 20:10:21,338 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (5 of 22 remaining) [2024-09-15 20:10:21,338 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (4 of 22 remaining) [2024-09-15 20:10:21,338 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (3 of 22 remaining) [2024-09-15 20:10:21,339 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (2 of 22 remaining) [2024-09-15 20:10:21,339 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (1 of 22 remaining) [2024-09-15 20:10:21,339 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (0 of 22 remaining) [2024-09-15 20:10:21,352 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-15 20:10:21,543 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-09-15 20:10:21,547 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:21,548 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 20:10:21,550 INFO L469 ceAbstractionStarter]: Automizer considered 4 witness invariants [2024-09-15 20:10:21,550 INFO L470 ceAbstractionStarter]: WitnessConsidered=4 [2024-09-15 20:10:21,550 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 08:10:21 BoogieIcfgContainer [2024-09-15 20:10:21,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 20:10:21,553 INFO L158 Benchmark]: Toolchain (without parser) took 6067.20ms. Allocated memory was 90.2MB in the beginning and 163.6MB in the end (delta: 73.4MB). Free memory was 67.6MB in the beginning and 92.8MB in the end (delta: -25.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-09-15 20:10:21,553 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 58.7MB. Free memory was 39.7MB in the beginning and 39.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:10:21,554 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 90.2MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:10:21,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.58ms. Allocated memory is still 90.2MB. Free memory was 67.2MB in the beginning and 42.4MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-09-15 20:10:21,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.16ms. Allocated memory is still 90.2MB. Free memory was 42.4MB in the beginning and 40.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 20:10:21,554 INFO L158 Benchmark]: Boogie Preprocessor took 85.20ms. Allocated memory is still 90.2MB. Free memory was 40.0MB in the beginning and 69.1MB in the end (delta: -29.2MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2024-09-15 20:10:21,554 INFO L158 Benchmark]: RCFGBuilder took 516.32ms. Allocated memory is still 90.2MB. Free memory was 69.1MB in the beginning and 44.9MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-09-15 20:10:21,554 INFO L158 Benchmark]: TraceAbstraction took 5017.59ms. Allocated memory was 90.2MB in the beginning and 163.6MB in the end (delta: 73.4MB). Free memory was 44.4MB in the beginning and 92.8MB in the end (delta: -48.3MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-09-15 20:10:21,555 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 58.7MB. Free memory was 39.7MB in the beginning and 39.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 90.2MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.58ms. Allocated memory is still 90.2MB. Free memory was 67.2MB in the beginning and 42.4MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.16ms. Allocated memory is still 90.2MB. Free memory was 42.4MB in the beginning and 40.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.20ms. Allocated memory is still 90.2MB. Free memory was 40.0MB in the beginning and 69.1MB in the end (delta: -29.2MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * RCFGBuilder took 516.32ms. Allocated memory is still 90.2MB. Free memory was 69.1MB in the beginning and 44.9MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5017.59ms. Allocated memory was 90.2MB in the beginning and 163.6MB in the end (delta: 73.4MB). Free memory was 44.4MB in the beginning and 92.8MB in the end (delta: -48.3MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 85]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 97]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 113]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 125]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 131]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 145]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 157]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 162]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 177]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 189]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 214]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 226]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 232]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 243]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 255]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 262]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 272]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 284]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 296]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 308]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 374]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 386]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1087 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1087 mSDsluCounter, 2649 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1611 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1766 IncrementalHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 1038 mSDtfsCounter, 1766 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 82 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 698 NumberOfCodeBlocks, 698 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 717 ConstructedInterpolants, 0 QuantifiedInterpolants, 2588 SizeOfPredicates, 2 NumberOfNonLiveVariables, 168 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 25 InterpolantComputations, 23 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-15 20:10:21,588 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...