./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/apache-get-tag.i.p+sep-reducer.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version de325976 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c ../results/automizer-verification-files/SV-COMP24_unreach-call/apache-get-tag.i.p+sep-reducer.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-de32597-m [2024-09-17 19:43:19,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-17 19:43:19,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-17 19:43:19,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-17 19:43:19,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-17 19:43:19,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-17 19:43:19,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-17 19:43:19,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-17 19:43:19,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-17 19:43:19,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-17 19:43:19,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-17 19:43:19,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-17 19:43:19,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-17 19:43:19,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-17 19:43:19,639 INFO L153 SettingsManager]: * Use SBE=true [2024-09-17 19:43:19,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-17 19:43:19,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-17 19:43:19,639 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-17 19:43:19,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-17 19:43:19,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-17 19:43:19,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-17 19:43:19,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-17 19:43:19,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-17 19:43:19,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-17 19:43:19,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-17 19:43:19,645 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-17 19:43:19,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-17 19:43:19,646 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-17 19:43:19,646 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-17 19:43:19,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-17 19:43:19,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-17 19:43:19,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-17 19:43:19,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 19:43:19,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-17 19:43:19,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-17 19:43:19,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-17 19:43:19,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-17 19:43:19,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-17 19:43:19,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-17 19:43:19,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-17 19:43:19,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-17 19:43:19,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-17 19:43:19,651 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-17 19:43:19,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-17 19:43:19,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-17 19:43:19,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-17 19:43:19,952 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-17 19:43:19,953 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-17 19:43:19,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/apache-get-tag.i.p+sep-reducer.yml/witness-2.1.yml [2024-09-17 19:43:20,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-17 19:43:20,021 INFO L274 PluginConnector]: CDTParser initialized [2024-09-17 19:43:20,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2024-09-17 19:43:21,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-17 19:43:21,689 INFO L384 CDTParser]: Found 1 translation units. [2024-09-17 19:43:21,690 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2024-09-17 19:43:21,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/ab2660810/1d7923a5055f4c1bbd2631549c16b1df/FLAGd58a4884f [2024-09-17 19:43:21,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/ab2660810/1d7923a5055f4c1bbd2631549c16b1df [2024-09-17 19:43:21,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-17 19:43:21,728 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-17 19:43:21,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-17 19:43:21,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-17 19:43:21,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-17 19:43:21,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 17.09 07:43:20" (1/2) ... [2024-09-17 19:43:21,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14362b55 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 17.09 07:43:21, skipping insertion in model container [2024-09-17 19:43:21,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 17.09 07:43:20" (1/2) ... [2024-09-17 19:43:21,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@42cca31c and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 17.09 07:43:21, skipping insertion in model container [2024-09-17 19:43:21,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 07:43:21" (2/2) ... [2024-09-17 19:43:21,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14362b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:43:21, skipping insertion in model container [2024-09-17 19:43:21,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 07:43:21" (2/2) ... [2024-09-17 19:43:21,808 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-17 19:43:21,809 INFO L1541 ArrayList]: Location invariant before [L128-L645] (((((((((((__tmp_148_0 == \old(__tmp_148_0)) && (\old(__tmp_179_1) == __tmp_179_1)) && (\old(__tmp_218_0) == __tmp_218_0)) && (0 <= main__t)) && (__tmp_2390_0 == \old(__tmp_2390_0))) && (\old(__tmp_179_2) == __tmp_179_2)) && (__tmp_109_1 == \old(__tmp_109_1))) && (__tmp_109_0 == \old(__tmp_109_0))) && (\old(__return_2583) == __return_2583)) && (__tmp_2390_1 == \old(__tmp_2390_1))) && (\old(__tmp_179_0) == __tmp_179_0)) [2024-09-17 19:43:21,809 INFO L1541 ArrayList]: Location invariant before [L335-L335] (0 < ((long long) main__t + 1)) [2024-09-17 19:43:21,809 INFO L1541 ArrayList]: Location invariant before [L4770-L4920] ((((long long) main__t + 1) <= main__tagbuf_len) && (61 <= main__t)) [2024-09-17 19:43:21,809 INFO L1541 ArrayList]: Location invariant before [L31-L5293] ((0 <= main__t) && (main__t <= main__tagbuf_len)) [2024-09-17 19:43:21,809 INFO L1541 ArrayList]: Location invariant before [L264-L599] (0 < ((long long) main__t + 1)) [2024-09-17 19:43:21,809 INFO L1541 ArrayList]: Location invariant before [L404-L552] (0 < ((long long) main__t + 1)) [2024-09-17 19:43:21,809 INFO L1541 ArrayList]: Location invariant before [L475-L475] (0 < ((long long) main__t + 1)) [2024-09-17 19:43:21,809 INFO L1541 ArrayList]: Location invariant before [L68-L5292] (0 < ((long long) main__t + 1)) [2024-09-17 19:43:21,810 INFO L1541 ArrayList]: Location invariant before [L360-L554] (0 < ((long long) main__t + 1)) [2024-09-17 19:43:21,810 INFO L1541 ArrayList]: Location invariant before [L4665-L4938] ((59 <= main__t) && (((long long) main__t + 1) <= main__tagbuf_len)) [2024-09-17 19:43:21,810 INFO L1541 ArrayList]: Location invariant before [L4734-L4921] ((61 <= main__t) && (main__t <= main__tagbuf_len)) [2024-09-17 19:43:21,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-17 19:43:22,111 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-get-tag.i.p+sep-reducer.c[1000,1013] [2024-09-17 19:43:22,129 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-get-tag.i.p+sep-reducer.c[1215,1228] [2024-09-17 19:43:22,523 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-get-tag.i.p+sep-reducer.c[83573,83586] [2024-09-17 19:43:22,527 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-get-tag.i.p+sep-reducer.c[83794,83807] [2024-09-17 19:43:22,531 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-get-tag.i.p+sep-reducer.c[84257,84270] [2024-09-17 19:43:22,534 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-get-tag.i.p+sep-reducer.c[84478,84491] [2024-09-17 19:43:22,538 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-get-tag.i.p+sep-reducer.c[84801,84814] [2024-09-17 19:43:22,542 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-get-tag.i.p+sep-reducer.c[85022,85035] [2024-09-17 19:43:22,545 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-get-tag.i.p+sep-reducer.c[85521,85534] [2024-09-17 19:43:22,549 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-get-tag.i.p+sep-reducer.c[85742,85755] [2024-09-17 19:43:22,553 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-get-tag.i.p+sep-reducer.c[86050,86063] [2024-09-17 19:43:22,556 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-get-tag.i.p+sep-reducer.c[86271,86284] [2024-09-17 19:43:22,560 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-get-tag.i.p+sep-reducer.c[86594,86607] [2024-09-17 19:43:22,564 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-get-tag.i.p+sep-reducer.c[86815,86828] [2024-09-17 19:43:22,568 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-get-tag.i.p+sep-reducer.c[87258,87271] [2024-09-17 19:43:22,571 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-get-tag.i.p+sep-reducer.c[87479,87492] [2024-09-17 19:43:22,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 19:43:22,602 INFO L200 MainTranslator]: Completed pre-run [2024-09-17 19:43:22,615 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-get-tag.i.p+sep-reducer.c[1000,1013] [2024-09-17 19:43:22,617 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-get-tag.i.p+sep-reducer.c[1215,1228] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-17 19:43:22,856 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-get-tag.i.p+sep-reducer.c[83573,83586] [2024-09-17 19:43:22,860 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-get-tag.i.p+sep-reducer.c[83794,83807] [2024-09-17 19:43:22,863 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-get-tag.i.p+sep-reducer.c[84257,84270] [2024-09-17 19:43:22,866 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-get-tag.i.p+sep-reducer.c[84478,84491] [2024-09-17 19:43:22,869 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-get-tag.i.p+sep-reducer.c[84801,84814] [2024-09-17 19:43:22,871 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-get-tag.i.p+sep-reducer.c[85022,85035] [2024-09-17 19:43:22,874 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-get-tag.i.p+sep-reducer.c[85521,85534] [2024-09-17 19:43:22,876 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-get-tag.i.p+sep-reducer.c[85742,85755] [2024-09-17 19:43:22,879 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-get-tag.i.p+sep-reducer.c[86050,86063] [2024-09-17 19:43:22,881 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-get-tag.i.p+sep-reducer.c[86271,86284] [2024-09-17 19:43:22,884 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-get-tag.i.p+sep-reducer.c[86594,86607] [2024-09-17 19:43:22,886 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-get-tag.i.p+sep-reducer.c[86815,86828] [2024-09-17 19:43:22,889 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-get-tag.i.p+sep-reducer.c[87258,87271] [2024-09-17 19:43:22,891 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-get-tag.i.p+sep-reducer.c[87479,87492] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-17 19:43:22,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 19:43:22,918 INFO L204 MainTranslator]: Completed translation [2024-09-17 19:43:22,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:43:22 WrapperNode [2024-09-17 19:43:22,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-17 19:43:22,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-17 19:43:22,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-17 19:43:22,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-17 19:43:22,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:43:22" (1/1) ... [2024-09-17 19:43:22,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:43:22" (1/1) ... [2024-09-17 19:43:23,046 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3609 [2024-09-17 19:43:23,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-17 19:43:23,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-17 19:43:23,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-17 19:43:23,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-17 19:43:23,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:43:22" (1/1) ... [2024-09-17 19:43:23,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:43:22" (1/1) ... [2024-09-17 19:43:23,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:43:22" (1/1) ... [2024-09-17 19:43:23,117 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-17 19:43:23,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:43:22" (1/1) ... [2024-09-17 19:43:23,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:43:22" (1/1) ... [2024-09-17 19:43:23,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:43:22" (1/1) ... [2024-09-17 19:43:23,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:43:22" (1/1) ... [2024-09-17 19:43:23,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:43:22" (1/1) ... [2024-09-17 19:43:23,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:43:22" (1/1) ... [2024-09-17 19:43:23,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-17 19:43:23,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-17 19:43:23,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-17 19:43:23,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-17 19:43:23,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:43:22" (1/1) ... [2024-09-17 19:43:23,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 19:43:23,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:43:23,241 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-17 19:43:23,244 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-17 19:43:23,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-17 19:43:23,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-17 19:43:23,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-17 19:43:23,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-17 19:43:23,613 INFO L242 CfgBuilder]: Building ICFG [2024-09-17 19:43:23,615 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-17 19:43:25,151 INFO L? ?]: Removed 1195 outVars from TransFormulas that were not future-live. [2024-09-17 19:43:25,151 INFO L291 CfgBuilder]: Performing block encoding [2024-09-17 19:43:25,211 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-17 19:43:25,211 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-17 19:43:25,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 07:43:25 BoogieIcfgContainer [2024-09-17 19:43:25,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-17 19:43:25,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-17 19:43:25,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-17 19:43:25,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-17 19:43:25,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 17.09 07:43:20" (1/4) ... [2024-09-17 19:43:25,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a06c4f and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 17.09 07:43:25, skipping insertion in model container [2024-09-17 19:43:25,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 07:43:21" (2/4) ... [2024-09-17 19:43:25,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a06c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 07:43:25, skipping insertion in model container [2024-09-17 19:43:25,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:43:22" (3/4) ... [2024-09-17 19:43:25,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a06c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 07:43:25, skipping insertion in model container [2024-09-17 19:43:25,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 07:43:25" (4/4) ... [2024-09-17 19:43:25,220 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2024-09-17 19:43:25,235 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-17 19:43:25,236 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-09-17 19:43:25,317 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-17 19:43:25,324 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;@72efd6d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-17 19:43:25,325 INFO L337 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-09-17 19:43:25,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 497 states, 469 states have (on average 1.9680170575692963) internal successors, (923), 496 states have internal predecessors, (923), 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-17 19:43:25,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-09-17 19:43:25,338 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:25,338 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-09-17 19:43:25,339 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:25,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2176180, now seen corresponding path program 1 times [2024-09-17 19:43:25,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:25,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764446750] [2024-09-17 19:43:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:25,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:25,609 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-17 19:43:25,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:25,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764446750] [2024-09-17 19:43:25,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764446750] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:25,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:25,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-17 19:43:25,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971793330] [2024-09-17 19:43:25,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:25,617 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-17 19:43:25,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:25,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-17 19:43:25,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-17 19:43:25,652 INFO L87 Difference]: Start difference. First operand has 497 states, 469 states have (on average 1.9680170575692963) internal successors, (923), 496 states have internal predecessors, (923), 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, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-17 19:43:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:26,410 INFO L93 Difference]: Finished difference Result 500 states and 910 transitions. [2024-09-17 19:43:26,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-17 19:43:26,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-09-17 19:43:26,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:26,428 INFO L225 Difference]: With dead ends: 500 [2024-09-17 19:43:26,429 INFO L226 Difference]: Without dead ends: 478 [2024-09-17 19:43:26,431 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-17 19:43:26,434 INFO L434 NwaCegarLoop]: 873 mSDtfsCounter, 15 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:26,436 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1207 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-17 19:43:26,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-09-17 19:43:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 474. [2024-09-17 19:43:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 449 states have (on average 1.3429844097995545) internal successors, (603), 473 states have internal predecessors, (603), 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-17 19:43:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 603 transitions. [2024-09-17 19:43:26,505 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 603 transitions. Word has length 3 [2024-09-17 19:43:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:26,505 INFO L474 AbstractCegarLoop]: Abstraction has 474 states and 603 transitions. [2024-09-17 19:43:26,505 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-17 19:43:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 603 transitions. [2024-09-17 19:43:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-17 19:43:26,506 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:26,506 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:43:26,506 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-17 19:43:26,506 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:26,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:26,507 INFO L85 PathProgramCache]: Analyzing trace with hash -295500520, now seen corresponding path program 1 times [2024-09-17 19:43:26,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:26,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152228776] [2024-09-17 19:43:26,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:26,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:26,657 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-17 19:43:26,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:26,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152228776] [2024-09-17 19:43:26,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152228776] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:26,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:26,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-17 19:43:26,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125297081] [2024-09-17 19:43:26,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:26,660 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-17 19:43:26,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:26,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-17 19:43:26,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-17 19:43:26,660 INFO L87 Difference]: Start difference. First operand 474 states and 603 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-17 19:43:27,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:27,547 INFO L93 Difference]: Finished difference Result 467 states and 596 transitions. [2024-09-17 19:43:27,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-17 19:43:27,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-09-17 19:43:27,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:27,549 INFO L225 Difference]: With dead ends: 467 [2024-09-17 19:43:27,549 INFO L226 Difference]: Without dead ends: 310 [2024-09-17 19:43:27,550 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-17 19:43:27,551 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 447 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:27,552 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 118 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-09-17 19:43:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-09-17 19:43:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-09-17 19:43:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 291 states have (on average 1.2817869415807561) internal successors, (373), 309 states have internal predecessors, (373), 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-17 19:43:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 373 transitions. [2024-09-17 19:43:27,561 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 373 transitions. Word has length 7 [2024-09-17 19:43:27,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:27,561 INFO L474 AbstractCegarLoop]: Abstraction has 310 states and 373 transitions. [2024-09-17 19:43:27,561 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-17 19:43:27,562 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 373 transitions. [2024-09-17 19:43:27,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-17 19:43:27,562 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:27,562 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:43:27,562 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-17 19:43:27,563 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:27,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:27,563 INFO L85 PathProgramCache]: Analyzing trace with hash -570577474, now seen corresponding path program 1 times [2024-09-17 19:43:27,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:27,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094177539] [2024-09-17 19:43:27,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:27,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:27,670 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-17 19:43:27,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:27,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094177539] [2024-09-17 19:43:27,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094177539] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:27,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:27,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-17 19:43:27,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132626878] [2024-09-17 19:43:27,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:27,672 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-17 19:43:27,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:27,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-17 19:43:27,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-17 19:43:27,673 INFO L87 Difference]: Start difference. First operand 310 states and 373 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-17 19:43:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:28,016 INFO L93 Difference]: Finished difference Result 322 states and 385 transitions. [2024-09-17 19:43:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-17 19:43:28,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-09-17 19:43:28,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:28,018 INFO L225 Difference]: With dead ends: 322 [2024-09-17 19:43:28,018 INFO L226 Difference]: Without dead ends: 319 [2024-09-17 19:43:28,018 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-17 19:43:28,019 INFO L434 NwaCegarLoop]: 336 mSDtfsCounter, 39 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:28,020 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 692 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-17 19:43:28,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-09-17 19:43:28,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 305. [2024-09-17 19:43:28,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 287 states have (on average 1.0731707317073171) internal successors, (308), 304 states have internal predecessors, (308), 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-17 19:43:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 308 transitions. [2024-09-17 19:43:28,035 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 308 transitions. Word has length 8 [2024-09-17 19:43:28,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:28,036 INFO L474 AbstractCegarLoop]: Abstraction has 305 states and 308 transitions. [2024-09-17 19:43:28,036 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-17 19:43:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 308 transitions. [2024-09-17 19:43:28,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-17 19:43:28,037 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:28,037 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:43:28,037 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-17 19:43:28,037 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:28,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:28,038 INFO L85 PathProgramCache]: Analyzing trace with hash -426948161, now seen corresponding path program 1 times [2024-09-17 19:43:28,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:28,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392038949] [2024-09-17 19:43:28,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:28,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:28,382 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-17 19:43:28,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:28,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392038949] [2024-09-17 19:43:28,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392038949] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:28,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:28,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-17 19:43:28,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248563760] [2024-09-17 19:43:28,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:28,384 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 19:43:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:28,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 19:43:28,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-17 19:43:28,386 INFO L87 Difference]: Start difference. First operand 305 states and 308 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-17 19:43:28,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:28,890 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2024-09-17 19:43:28,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 19:43:28,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-09-17 19:43:28,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:28,892 INFO L225 Difference]: With dead ends: 304 [2024-09-17 19:43:28,892 INFO L226 Difference]: Without dead ends: 300 [2024-09-17 19:43:28,892 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-17 19:43:28,893 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 180 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:28,895 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 174 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-17 19:43:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-09-17 19:43:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-09-17 19:43:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 283 states have (on average 1.0706713780918728) internal successors, (303), 299 states have internal predecessors, (303), 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-17 19:43:28,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 303 transitions. [2024-09-17 19:43:28,911 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 303 transitions. Word has length 10 [2024-09-17 19:43:28,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:28,911 INFO L474 AbstractCegarLoop]: Abstraction has 300 states and 303 transitions. [2024-09-17 19:43:28,911 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-17 19:43:28,911 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 303 transitions. [2024-09-17 19:43:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-09-17 19:43:28,921 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:28,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:28,922 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-17 19:43:28,922 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:28,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:28,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1375169740, now seen corresponding path program 1 times [2024-09-17 19:43:28,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:28,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417386724] [2024-09-17 19:43:28,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:28,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:41,888 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-17 19:43:41,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:41,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417386724] [2024-09-17 19:43:41,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417386724] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:41,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:41,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [122] imperfect sequences [] total 122 [2024-09-17 19:43:41,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90795276] [2024-09-17 19:43:41,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:41,891 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2024-09-17 19:43:41,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:41,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2024-09-17 19:43:41,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5438, Invalid=9568, Unknown=0, NotChecked=0, Total=15006 [2024-09-17 19:43:41,900 INFO L87 Difference]: Start difference. First operand 300 states and 303 transitions. Second operand has 123 states, 122 states have (on average 1.9918032786885247) internal successors, (243), 123 states have internal predecessors, (243), 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-17 19:43:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:43,117 INFO L93 Difference]: Finished difference Result 299 states and 302 transitions. [2024-09-17 19:43:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-09-17 19:43:43,118 INFO L78 Accepts]: Start accepts. Automaton has has 123 states, 122 states have (on average 1.9918032786885247) internal successors, (243), 123 states have internal predecessors, (243), 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 243 [2024-09-17 19:43:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:43,120 INFO L225 Difference]: With dead ends: 299 [2024-09-17 19:43:43,120 INFO L226 Difference]: Without dead ends: 299 [2024-09-17 19:43:43,125 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1889 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5438, Invalid=9568, Unknown=0, NotChecked=0, Total=15006 [2024-09-17 19:43:43,126 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 272 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2572 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:43,127 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 164 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2572 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-09-17 19:43:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-09-17 19:43:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2024-09-17 19:43:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 283 states have (on average 1.0671378091872792) internal successors, (302), 298 states have internal predecessors, (302), 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-17 19:43:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 302 transitions. [2024-09-17 19:43:43,134 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 302 transitions. Word has length 243 [2024-09-17 19:43:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:43,136 INFO L474 AbstractCegarLoop]: Abstraction has 299 states and 302 transitions. [2024-09-17 19:43:43,138 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 122 states have (on average 1.9918032786885247) internal successors, (243), 123 states have internal predecessors, (243), 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-17 19:43:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 302 transitions. [2024-09-17 19:43:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-09-17 19:43:43,144 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:43,144 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:43,144 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-17 19:43:43,145 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:43,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:43,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2138756656, now seen corresponding path program 1 times [2024-09-17 19:43:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:43,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598861030] [2024-09-17 19:43:43,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:43,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:43,514 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-17 19:43:43,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:43,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598861030] [2024-09-17 19:43:43,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598861030] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:43,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:43,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-17 19:43:43,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721099127] [2024-09-17 19:43:43,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:43,517 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-17 19:43:43,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:43,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-17 19:43:43,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-17 19:43:43,521 INFO L87 Difference]: Start difference. First operand 299 states and 302 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 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-17 19:43:43,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:43,901 INFO L93 Difference]: Finished difference Result 297 states and 300 transitions. [2024-09-17 19:43:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-17 19:43:43,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 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 247 [2024-09-17 19:43:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:43,903 INFO L225 Difference]: With dead ends: 297 [2024-09-17 19:43:43,903 INFO L226 Difference]: Without dead ends: 297 [2024-09-17 19:43:43,903 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-17 19:43:43,906 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 222 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:43,906 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 74 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-17 19:43:43,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-09-17 19:43:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-09-17 19:43:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 282 states have (on average 1.0638297872340425) internal successors, (300), 296 states have internal predecessors, (300), 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-17 19:43:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 300 transitions. [2024-09-17 19:43:43,911 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 300 transitions. Word has length 247 [2024-09-17 19:43:43,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:43,912 INFO L474 AbstractCegarLoop]: Abstraction has 297 states and 300 transitions. [2024-09-17 19:43:43,913 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 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-17 19:43:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 300 transitions. [2024-09-17 19:43:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-09-17 19:43:43,918 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:43,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:43,919 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-17 19:43:43,919 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:43,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:43,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1876953018, now seen corresponding path program 1 times [2024-09-17 19:43:43,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:43,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657301476] [2024-09-17 19:43:43,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:43,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:44,213 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-17 19:43:44,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:44,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657301476] [2024-09-17 19:43:44,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657301476] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:44,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:44,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-17 19:43:44,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219218410] [2024-09-17 19:43:44,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:44,215 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-17 19:43:44,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:44,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-17 19:43:44,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-17 19:43:44,216 INFO L87 Difference]: Start difference. First operand 297 states and 300 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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-17 19:43:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:44,503 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2024-09-17 19:43:44,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-17 19:43:44,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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 248 [2024-09-17 19:43:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:44,505 INFO L225 Difference]: With dead ends: 307 [2024-09-17 19:43:44,505 INFO L226 Difference]: Without dead ends: 307 [2024-09-17 19:43:44,505 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-17 19:43:44,506 INFO L434 NwaCegarLoop]: 273 mSDtfsCounter, 32 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:44,507 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 563 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-17 19:43:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-09-17 19:43:44,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 300. [2024-09-17 19:43:44,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 285 states have (on average 1.063157894736842) internal successors, (303), 299 states have internal predecessors, (303), 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-17 19:43:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 303 transitions. [2024-09-17 19:43:44,514 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 303 transitions. Word has length 248 [2024-09-17 19:43:44,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:44,514 INFO L474 AbstractCegarLoop]: Abstraction has 300 states and 303 transitions. [2024-09-17 19:43:44,514 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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-17 19:43:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 303 transitions. [2024-09-17 19:43:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-09-17 19:43:44,516 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:44,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:44,517 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-17 19:43:44,517 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:44,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 134153402, now seen corresponding path program 1 times [2024-09-17 19:43:44,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:44,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519860792] [2024-09-17 19:43:44,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:44,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:44,811 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-17 19:43:44,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:44,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519860792] [2024-09-17 19:43:44,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519860792] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:44,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:44,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 19:43:44,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462922336] [2024-09-17 19:43:44,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:44,813 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 19:43:44,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:44,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 19:43:44,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-17 19:43:44,814 INFO L87 Difference]: Start difference. First operand 300 states and 303 transitions. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 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-17 19:43:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:45,087 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2024-09-17 19:43:45,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 19:43:45,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 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 251 [2024-09-17 19:43:45,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:45,090 INFO L225 Difference]: With dead ends: 298 [2024-09-17 19:43:45,090 INFO L226 Difference]: Without dead ends: 298 [2024-09-17 19:43:45,090 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-17 19:43:45,090 INFO L434 NwaCegarLoop]: 269 mSDtfsCounter, 74 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:45,091 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 546 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-17 19:43:45,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-09-17 19:43:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-09-17 19:43:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 284 states have (on average 1.0598591549295775) internal successors, (301), 297 states have internal predecessors, (301), 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-17 19:43:45,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 301 transitions. [2024-09-17 19:43:45,100 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 301 transitions. Word has length 251 [2024-09-17 19:43:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:45,100 INFO L474 AbstractCegarLoop]: Abstraction has 298 states and 301 transitions. [2024-09-17 19:43:45,100 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 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-17 19:43:45,101 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 301 transitions. [2024-09-17 19:43:45,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-09-17 19:43:45,103 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:45,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:45,103 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-17 19:43:45,103 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:45,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:45,104 INFO L85 PathProgramCache]: Analyzing trace with hash -136205690, now seen corresponding path program 1 times [2024-09-17 19:43:45,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:45,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123625999] [2024-09-17 19:43:45,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:45,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:45,403 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-17 19:43:45,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:45,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123625999] [2024-09-17 19:43:45,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123625999] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:45,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:45,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 19:43:45,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55676803] [2024-09-17 19:43:45,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:45,405 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 19:43:45,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:45,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 19:43:45,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-17 19:43:45,407 INFO L87 Difference]: Start difference. First operand 298 states and 301 transitions. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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-17 19:43:45,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:45,838 INFO L93 Difference]: Finished difference Result 296 states and 299 transitions. [2024-09-17 19:43:45,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 19:43:45,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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 252 [2024-09-17 19:43:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:45,840 INFO L225 Difference]: With dead ends: 296 [2024-09-17 19:43:45,840 INFO L226 Difference]: Without dead ends: 296 [2024-09-17 19:43:45,840 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-17 19:43:45,840 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 153 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:45,841 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 76 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-17 19:43:45,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-09-17 19:43:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2024-09-17 19:43:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 283 states have (on average 1.0565371024734982) internal successors, (299), 295 states have internal predecessors, (299), 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-17 19:43:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 299 transitions. [2024-09-17 19:43:45,845 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 299 transitions. Word has length 252 [2024-09-17 19:43:45,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:45,846 INFO L474 AbstractCegarLoop]: Abstraction has 296 states and 299 transitions. [2024-09-17 19:43:45,846 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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-17 19:43:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 299 transitions. [2024-09-17 19:43:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-09-17 19:43:45,848 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:45,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:45,849 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-17 19:43:45,849 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:45,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:45,850 INFO L85 PathProgramCache]: Analyzing trace with hash -136205427, now seen corresponding path program 1 times [2024-09-17 19:43:45,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:45,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356611907] [2024-09-17 19:43:45,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:45,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:46,218 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-17 19:43:46,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:46,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356611907] [2024-09-17 19:43:46,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356611907] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:46,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:46,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 19:43:46,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983571185] [2024-09-17 19:43:46,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:46,220 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-17 19:43:46,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:46,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-17 19:43:46,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-17 19:43:46,221 INFO L87 Difference]: Start difference. First operand 296 states and 299 transitions. Second operand has 6 states, 5 states have (on average 50.4) internal successors, (252), 6 states have internal predecessors, (252), 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-17 19:43:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:46,846 INFO L93 Difference]: Finished difference Result 303 states and 307 transitions. [2024-09-17 19:43:46,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-17 19:43:46,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 50.4) internal successors, (252), 6 states have internal predecessors, (252), 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 252 [2024-09-17 19:43:46,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:46,849 INFO L225 Difference]: With dead ends: 303 [2024-09-17 19:43:46,849 INFO L226 Difference]: Without dead ends: 303 [2024-09-17 19:43:46,849 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-17 19:43:46,850 INFO L434 NwaCegarLoop]: 270 mSDtfsCounter, 62 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:46,850 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 312 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-17 19:43:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-09-17 19:43:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 294. [2024-09-17 19:43:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 283 states have (on average 1.0494699646643109) internal successors, (297), 293 states have internal predecessors, (297), 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-17 19:43:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 297 transitions. [2024-09-17 19:43:46,855 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 297 transitions. Word has length 252 [2024-09-17 19:43:46,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:46,855 INFO L474 AbstractCegarLoop]: Abstraction has 294 states and 297 transitions. [2024-09-17 19:43:46,856 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 50.4) internal successors, (252), 6 states have internal predecessors, (252), 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-17 19:43:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 297 transitions. [2024-09-17 19:43:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-09-17 19:43:46,858 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:46,858 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:46,858 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-17 19:43:46,858 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:46,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:46,859 INFO L85 PathProgramCache]: Analyzing trace with hash 182526841, now seen corresponding path program 1 times [2024-09-17 19:43:46,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:46,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764871663] [2024-09-17 19:43:46,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:46,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 19:43:47,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:47,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764871663] [2024-09-17 19:43:47,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764871663] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:43:47,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187055068] [2024-09-17 19:43:47,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:47,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:43:47,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:43:47,162 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-17 19:43:47,164 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-17 19:43:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:47,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 1248 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-17 19:43:47,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:43:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 19:43:47,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:43:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 19:43:47,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187055068] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:43:47,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 19:43:47,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-09-17 19:43:47,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591794365] [2024-09-17 19:43:47,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 19:43:47,878 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-17 19:43:47,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:47,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-17 19:43:47,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-17 19:43:47,880 INFO L87 Difference]: Start difference. First operand 294 states and 297 transitions. Second operand has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 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-17 19:43:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:48,353 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2024-09-17 19:43:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 19:43:48,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 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 253 [2024-09-17 19:43:48,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:48,356 INFO L225 Difference]: With dead ends: 292 [2024-09-17 19:43:48,356 INFO L226 Difference]: Without dead ends: 292 [2024-09-17 19:43:48,356 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 502 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-17 19:43:48,357 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 151 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:48,357 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 72 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-17 19:43:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-09-17 19:43:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2024-09-17 19:43:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 279 states have (on average 1.0465949820788532) internal successors, (292), 288 states have internal predecessors, (292), 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-17 19:43:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 292 transitions. [2024-09-17 19:43:48,363 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 292 transitions. Word has length 253 [2024-09-17 19:43:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:48,363 INFO L474 AbstractCegarLoop]: Abstraction has 289 states and 292 transitions. [2024-09-17 19:43:48,364 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 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-17 19:43:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 292 transitions. [2024-09-17 19:43:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-09-17 19:43:48,366 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:48,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:48,389 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-17 19:43:48,567 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-17 19:43:48,568 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:48,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:48,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1050357983, now seen corresponding path program 1 times [2024-09-17 19:43:48,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:48,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119605107] [2024-09-17 19:43:48,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:48,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:48,877 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-17 19:43:48,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:48,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119605107] [2024-09-17 19:43:48,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119605107] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:48,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:48,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-17 19:43:48,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606747293] [2024-09-17 19:43:48,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:48,878 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-17 19:43:48,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:48,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-17 19:43:48,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-17 19:43:48,879 INFO L87 Difference]: Start difference. First operand 289 states and 292 transitions. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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-17 19:43:49,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:49,200 INFO L93 Difference]: Finished difference Result 287 states and 290 transitions. [2024-09-17 19:43:49,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-17 19:43:49,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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 255 [2024-09-17 19:43:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:49,201 INFO L225 Difference]: With dead ends: 287 [2024-09-17 19:43:49,202 INFO L226 Difference]: Without dead ends: 287 [2024-09-17 19:43:49,202 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-17 19:43:49,202 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 215 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:49,203 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 58 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-17 19:43:49,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-09-17 19:43:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-09-17 19:43:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 278 states have (on average 1.0431654676258992) internal successors, (290), 286 states have internal predecessors, (290), 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-17 19:43:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 290 transitions. [2024-09-17 19:43:49,207 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 290 transitions. Word has length 255 [2024-09-17 19:43:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:49,208 INFO L474 AbstractCegarLoop]: Abstraction has 287 states and 290 transitions. [2024-09-17 19:43:49,208 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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-17 19:43:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 290 transitions. [2024-09-17 19:43:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-09-17 19:43:49,209 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:49,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:49,209 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-17 19:43:49,210 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:49,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:49,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1798634730, now seen corresponding path program 1 times [2024-09-17 19:43:49,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:49,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543078418] [2024-09-17 19:43:49,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:49,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:49,437 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-17 19:43:49,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:49,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543078418] [2024-09-17 19:43:49,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543078418] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:49,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:49,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-17 19:43:49,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254758458] [2024-09-17 19:43:49,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:49,438 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-17 19:43:49,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:49,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-17 19:43:49,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-17 19:43:49,439 INFO L87 Difference]: Start difference. First operand 287 states and 290 transitions. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-17 19:43:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:49,652 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2024-09-17 19:43:49,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-17 19:43:49,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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 256 [2024-09-17 19:43:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:49,654 INFO L225 Difference]: With dead ends: 295 [2024-09-17 19:43:49,654 INFO L226 Difference]: Without dead ends: 293 [2024-09-17 19:43:49,654 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-17 19:43:49,654 INFO L434 NwaCegarLoop]: 263 mSDtfsCounter, 31 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:49,655 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 536 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 19:43:49,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-09-17 19:43:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 283. [2024-09-17 19:43:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 275 states have (on average 1.04) internal successors, (286), 282 states have internal predecessors, (286), 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-17 19:43:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 286 transitions. [2024-09-17 19:43:49,659 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 286 transitions. Word has length 256 [2024-09-17 19:43:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:49,660 INFO L474 AbstractCegarLoop]: Abstraction has 283 states and 286 transitions. [2024-09-17 19:43:49,660 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-17 19:43:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 286 transitions. [2024-09-17 19:43:49,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-09-17 19:43:49,661 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:49,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:49,662 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-17 19:43:49,662 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:49,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:49,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1346411396, now seen corresponding path program 1 times [2024-09-17 19:43:49,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:49,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643248762] [2024-09-17 19:43:49,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:49,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:49,940 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-17 19:43:49,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643248762] [2024-09-17 19:43:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643248762] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:49,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:49,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-17 19:43:49,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892954272] [2024-09-17 19:43:49,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:49,942 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-17 19:43:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:49,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-17 19:43:49,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-17 19:43:49,943 INFO L87 Difference]: Start difference. First operand 283 states and 286 transitions. Second operand has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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-17 19:43:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:50,247 INFO L93 Difference]: Finished difference Result 281 states and 284 transitions. [2024-09-17 19:43:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-17 19:43:50,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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 258 [2024-09-17 19:43:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:50,249 INFO L225 Difference]: With dead ends: 281 [2024-09-17 19:43:50,249 INFO L226 Difference]: Without dead ends: 281 [2024-09-17 19:43:50,249 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-17 19:43:50,250 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 209 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:50,250 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 48 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-17 19:43:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-09-17 19:43:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-09-17 19:43:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 274 states have (on average 1.0364963503649636) internal successors, (284), 280 states have internal predecessors, (284), 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-17 19:43:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 284 transitions. [2024-09-17 19:43:50,256 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 284 transitions. Word has length 258 [2024-09-17 19:43:50,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:50,257 INFO L474 AbstractCegarLoop]: Abstraction has 281 states and 284 transitions. [2024-09-17 19:43:50,257 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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-17 19:43:50,258 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 284 transitions. [2024-09-17 19:43:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-09-17 19:43:50,259 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:50,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:50,259 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-17 19:43:50,259 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:50,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1344687492, now seen corresponding path program 1 times [2024-09-17 19:43:50,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:50,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888941465] [2024-09-17 19:43:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:50,511 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-17 19:43:50,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:50,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888941465] [2024-09-17 19:43:50,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888941465] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:50,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:50,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-17 19:43:50,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654541852] [2024-09-17 19:43:50,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:50,513 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-17 19:43:50,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:50,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-17 19:43:50,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-17 19:43:50,513 INFO L87 Difference]: Start difference. First operand 281 states and 284 transitions. Second operand has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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-17 19:43:50,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:50,848 INFO L93 Difference]: Finished difference Result 279 states and 282 transitions. [2024-09-17 19:43:50,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-17 19:43:50,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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 258 [2024-09-17 19:43:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:50,850 INFO L225 Difference]: With dead ends: 279 [2024-09-17 19:43:50,850 INFO L226 Difference]: Without dead ends: 279 [2024-09-17 19:43:50,850 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-17 19:43:50,851 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 207 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:50,851 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 44 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-17 19:43:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-09-17 19:43:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2024-09-17 19:43:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 273 states have (on average 1.032967032967033) internal successors, (282), 278 states have internal predecessors, (282), 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-17 19:43:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 282 transitions. [2024-09-17 19:43:50,855 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 282 transitions. Word has length 258 [2024-09-17 19:43:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:50,856 INFO L474 AbstractCegarLoop]: Abstraction has 279 states and 282 transitions. [2024-09-17 19:43:50,856 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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-17 19:43:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 282 transitions. [2024-09-17 19:43:50,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-09-17 19:43:50,857 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:50,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:50,858 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-17 19:43:50,858 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:50,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:50,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1210925874, now seen corresponding path program 1 times [2024-09-17 19:43:50,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:50,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976541983] [2024-09-17 19:43:50,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:50,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:51,096 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-17 19:43:51,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:51,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976541983] [2024-09-17 19:43:51,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976541983] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:51,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:51,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-17 19:43:51,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205104095] [2024-09-17 19:43:51,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:51,098 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-17 19:43:51,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:51,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-17 19:43:51,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-17 19:43:51,099 INFO L87 Difference]: Start difference. First operand 279 states and 282 transitions. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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-17 19:43:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:51,348 INFO L93 Difference]: Finished difference Result 287 states and 290 transitions. [2024-09-17 19:43:51,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-17 19:43:51,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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 259 [2024-09-17 19:43:51,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:51,350 INFO L225 Difference]: With dead ends: 287 [2024-09-17 19:43:51,350 INFO L226 Difference]: Without dead ends: 287 [2024-09-17 19:43:51,350 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-17 19:43:51,350 INFO L434 NwaCegarLoop]: 257 mSDtfsCounter, 21 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:51,351 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 524 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 19:43:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-09-17 19:43:51,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 277. [2024-09-17 19:43:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 272 states have (on average 1.0294117647058822) internal successors, (280), 276 states have internal predecessors, (280), 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-17 19:43:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 280 transitions. [2024-09-17 19:43:51,355 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 280 transitions. Word has length 259 [2024-09-17 19:43:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:51,356 INFO L474 AbstractCegarLoop]: Abstraction has 277 states and 280 transitions. [2024-09-17 19:43:51,356 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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-17 19:43:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 280 transitions. [2024-09-17 19:43:51,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-09-17 19:43:51,376 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:51,376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:51,376 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-17 19:43:51,376 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:51,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:51,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1211998349, now seen corresponding path program 1 times [2024-09-17 19:43:51,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:51,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888813156] [2024-09-17 19:43:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:51,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:51,591 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-17 19:43:51,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:51,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888813156] [2024-09-17 19:43:51,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888813156] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:51,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:51,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-17 19:43:51,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768109525] [2024-09-17 19:43:51,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:51,593 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-17 19:43:51,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:51,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-17 19:43:51,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-17 19:43:51,594 INFO L87 Difference]: Start difference. First operand 277 states and 280 transitions. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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-17 19:43:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:51,903 INFO L93 Difference]: Finished difference Result 275 states and 278 transitions. [2024-09-17 19:43:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-17 19:43:51,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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 259 [2024-09-17 19:43:51,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:51,905 INFO L225 Difference]: With dead ends: 275 [2024-09-17 19:43:51,906 INFO L226 Difference]: Without dead ends: 275 [2024-09-17 19:43:51,906 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-17 19:43:51,906 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 202 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:51,907 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 36 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-17 19:43:51,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-09-17 19:43:51,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-09-17 19:43:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 271 states have (on average 1.0258302583025831) internal successors, (278), 274 states have internal predecessors, (278), 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-17 19:43:51,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 278 transitions. [2024-09-17 19:43:51,911 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 278 transitions. Word has length 259 [2024-09-17 19:43:51,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:51,911 INFO L474 AbstractCegarLoop]: Abstraction has 275 states and 278 transitions. [2024-09-17 19:43:51,911 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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-17 19:43:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 278 transitions. [2024-09-17 19:43:51,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-09-17 19:43:51,913 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:51,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:51,913 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-17 19:43:51,913 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:51,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:51,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1264366954, now seen corresponding path program 1 times [2024-09-17 19:43:51,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:51,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959260825] [2024-09-17 19:43:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:51,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:52,148 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-17 19:43:52,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:52,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959260825] [2024-09-17 19:43:52,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959260825] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:52,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:52,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-17 19:43:52,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937210426] [2024-09-17 19:43:52,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:52,150 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-17 19:43:52,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:52,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-17 19:43:52,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-17 19:43:52,151 INFO L87 Difference]: Start difference. First operand 275 states and 278 transitions. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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-17 19:43:52,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:52,368 INFO L93 Difference]: Finished difference Result 281 states and 284 transitions. [2024-09-17 19:43:52,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-17 19:43:52,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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 259 [2024-09-17 19:43:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:52,370 INFO L225 Difference]: With dead ends: 281 [2024-09-17 19:43:52,370 INFO L226 Difference]: Without dead ends: 279 [2024-09-17 19:43:52,370 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-17 19:43:52,371 INFO L434 NwaCegarLoop]: 253 mSDtfsCounter, 19 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:52,371 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 512 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 19:43:52,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-09-17 19:43:52,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 271. [2024-09-17 19:43:52,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 268 states have (on average 1.0223880597014925) internal successors, (274), 270 states have internal predecessors, (274), 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-17 19:43:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 274 transitions. [2024-09-17 19:43:52,375 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 274 transitions. Word has length 259 [2024-09-17 19:43:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:52,376 INFO L474 AbstractCegarLoop]: Abstraction has 271 states and 274 transitions. [2024-09-17 19:43:52,376 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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-17 19:43:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 274 transitions. [2024-09-17 19:43:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-09-17 19:43:52,377 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:52,378 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:52,378 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-17 19:43:52,378 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:52,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:52,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1082750618, now seen corresponding path program 1 times [2024-09-17 19:43:52,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:52,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204088254] [2024-09-17 19:43:52,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:52,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:52,607 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-17 19:43:52,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:52,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204088254] [2024-09-17 19:43:52,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204088254] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:52,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:52,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-17 19:43:52,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361740295] [2024-09-17 19:43:52,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:52,609 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-17 19:43:52,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:52,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-17 19:43:52,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-17 19:43:52,610 INFO L87 Difference]: Start difference. First operand 271 states and 274 transitions. Second operand has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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-17 19:43:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:52,816 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2024-09-17 19:43:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-17 19:43:52,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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 260 [2024-09-17 19:43:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:52,817 INFO L225 Difference]: With dead ends: 277 [2024-09-17 19:43:52,818 INFO L226 Difference]: Without dead ends: 277 [2024-09-17 19:43:52,818 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-17 19:43:52,818 INFO L434 NwaCegarLoop]: 253 mSDtfsCounter, 15 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:52,818 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 511 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 19:43:52,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-09-17 19:43:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 274. [2024-09-17 19:43:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 271 states have (on average 1.022140221402214) internal successors, (277), 273 states have internal predecessors, (277), 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-17 19:43:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 277 transitions. [2024-09-17 19:43:52,823 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 277 transitions. Word has length 260 [2024-09-17 19:43:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:52,824 INFO L474 AbstractCegarLoop]: Abstraction has 274 states and 277 transitions. [2024-09-17 19:43:52,825 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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-17 19:43:52,825 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 277 transitions. [2024-09-17 19:43:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-09-17 19:43:52,826 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:52,826 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:52,826 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-17 19:43:52,827 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:52,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash -236177963, now seen corresponding path program 1 times [2024-09-17 19:43:52,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:52,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406476880] [2024-09-17 19:43:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:52,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:53,072 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-17 19:43:53,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:53,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406476880] [2024-09-17 19:43:53,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406476880] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:53,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:53,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 19:43:53,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486349064] [2024-09-17 19:43:53,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:53,074 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 19:43:53,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:53,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 19:43:53,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-17 19:43:53,075 INFO L87 Difference]: Start difference. First operand 274 states and 277 transitions. Second operand has 5 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 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-17 19:43:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:53,456 INFO L93 Difference]: Finished difference Result 283 states and 288 transitions. [2024-09-17 19:43:53,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 19:43:53,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 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 261 [2024-09-17 19:43:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:53,458 INFO L225 Difference]: With dead ends: 283 [2024-09-17 19:43:53,458 INFO L226 Difference]: Without dead ends: 283 [2024-09-17 19:43:53,458 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-17 19:43:53,459 INFO L434 NwaCegarLoop]: 260 mSDtfsCounter, 20 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:53,459 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 534 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-17 19:43:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-09-17 19:43:53,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 272. [2024-09-17 19:43:53,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 270 states have (on average 1.0185185185185186) internal successors, (275), 271 states have internal predecessors, (275), 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-17 19:43:53,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 275 transitions. [2024-09-17 19:43:53,463 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 275 transitions. Word has length 261 [2024-09-17 19:43:53,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:53,463 INFO L474 AbstractCegarLoop]: Abstraction has 272 states and 275 transitions. [2024-09-17 19:43:53,464 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 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-17 19:43:53,464 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 275 transitions. [2024-09-17 19:43:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-09-17 19:43:53,465 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:53,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:53,465 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-17 19:43:53,465 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:53,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:53,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1268423946, now seen corresponding path program 1 times [2024-09-17 19:43:53,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:53,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885829127] [2024-09-17 19:43:53,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:53,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:53,723 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-17 19:43:53,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:53,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885829127] [2024-09-17 19:43:53,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885829127] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:53,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:53,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-17 19:43:53,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744273350] [2024-09-17 19:43:53,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:53,725 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-17 19:43:53,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:53,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-17 19:43:53,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-17 19:43:53,726 INFO L87 Difference]: Start difference. First operand 272 states and 275 transitions. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 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-17 19:43:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:53,919 INFO L93 Difference]: Finished difference Result 273 states and 276 transitions. [2024-09-17 19:43:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-17 19:43:53,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 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 262 [2024-09-17 19:43:53,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:53,921 INFO L225 Difference]: With dead ends: 273 [2024-09-17 19:43:53,921 INFO L226 Difference]: Without dead ends: 271 [2024-09-17 19:43:53,921 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-17 19:43:53,921 INFO L434 NwaCegarLoop]: 249 mSDtfsCounter, 18 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:53,922 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 502 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 19:43:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-09-17 19:43:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2024-09-17 19:43:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.0149812734082397) internal successors, (271), 267 states have internal predecessors, (271), 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-17 19:43:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2024-09-17 19:43:53,926 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 262 [2024-09-17 19:43:53,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:53,926 INFO L474 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2024-09-17 19:43:53,926 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 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-17 19:43:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2024-09-17 19:43:53,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-09-17 19:43:53,928 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:43:53,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:43:53,928 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-17 19:43:53,928 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2024-09-17 19:43:53,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:43:53,929 INFO L85 PathProgramCache]: Analyzing trace with hash 681619404, now seen corresponding path program 1 times [2024-09-17 19:43:53,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:43:53,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291825063] [2024-09-17 19:43:53,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:43:53,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:43:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:43:54,301 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-17 19:43:54,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:43:54,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291825063] [2024-09-17 19:43:54,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291825063] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:43:54,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:43:54,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 19:43:54,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811180490] [2024-09-17 19:43:54,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:43:54,303 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 19:43:54,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:43:54,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 19:43:54,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-17 19:43:54,304 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 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-17 19:43:54,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:43:54,630 INFO L93 Difference]: Finished difference Result 266 states and 269 transitions. [2024-09-17 19:43:54,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 19:43:54,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 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 263 [2024-09-17 19:43:54,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:43:54,631 INFO L225 Difference]: With dead ends: 266 [2024-09-17 19:43:54,631 INFO L226 Difference]: Without dead ends: 0 [2024-09-17 19:43:54,631 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-17 19:43:54,632 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 133 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-17 19:43:54,632 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 16 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-17 19:43:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-17 19:43:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-17 19:43:54,632 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-17 19:43:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-17 19:43:54,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 263 [2024-09-17 19:43:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:43:54,633 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-17 19:43:54,633 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 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-17 19:43:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-17 19:43:54,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-17 19:43:54,636 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 27 remaining) [2024-09-17 19:43:54,637 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (25 of 27 remaining) [2024-09-17 19:43:54,637 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (24 of 27 remaining) [2024-09-17 19:43:54,637 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 27 remaining) [2024-09-17 19:43:54,638 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 27 remaining) [2024-09-17 19:43:54,638 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 27 remaining) [2024-09-17 19:43:54,638 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 27 remaining) [2024-09-17 19:43:54,638 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 27 remaining) [2024-09-17 19:43:54,638 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 27 remaining) [2024-09-17 19:43:54,638 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 27 remaining) [2024-09-17 19:43:54,638 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 27 remaining) [2024-09-17 19:43:54,638 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (15 of 27 remaining) [2024-09-17 19:43:54,638 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (14 of 27 remaining) [2024-09-17 19:43:54,639 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (13 of 27 remaining) [2024-09-17 19:43:54,639 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (12 of 27 remaining) [2024-09-17 19:43:54,639 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 27 remaining) [2024-09-17 19:43:54,639 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (10 of 27 remaining) [2024-09-17 19:43:54,639 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (9 of 27 remaining) [2024-09-17 19:43:54,639 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 27 remaining) [2024-09-17 19:43:54,640 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (7 of 27 remaining) [2024-09-17 19:43:54,640 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (6 of 27 remaining) [2024-09-17 19:43:54,640 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (5 of 27 remaining) [2024-09-17 19:43:54,640 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (4 of 27 remaining) [2024-09-17 19:43:54,640 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (3 of 27 remaining) [2024-09-17 19:43:54,640 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (2 of 27 remaining) [2024-09-17 19:43:54,641 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (1 of 27 remaining) [2024-09-17 19:43:54,641 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (0 of 27 remaining) [2024-09-17 19:43:54,641 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-17 19:43:54,643 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] [2024-09-17 19:43:54,645 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-17 19:43:54,647 INFO L469 ceAbstractionStarter]: Automizer considered 11 witness invariants [2024-09-17 19:43:54,647 INFO L470 ceAbstractionStarter]: WitnessConsidered=11 [2024-09-17 19:43:54,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.09 07:43:54 BoogieIcfgContainer [2024-09-17 19:43:54,648 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-17 19:43:54,649 INFO L158 Benchmark]: Toolchain (without parser) took 32920.61ms. Allocated memory was 148.9MB in the beginning and 977.3MB in the end (delta: 828.4MB). Free memory was 117.2MB in the beginning and 733.7MB in the end (delta: -616.5MB). Peak memory consumption was 211.1MB. Max. memory is 16.1GB. [2024-09-17 19:43:54,649 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 109.1MB. Free memory was 82.0MB in the beginning and 81.9MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 19:43:54,649 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 109.1MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 19:43:54,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1187.07ms. Allocated memory is still 148.9MB. Free memory was 116.2MB in the beginning and 87.0MB in the end (delta: 29.2MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2024-09-17 19:43:54,649 INFO L158 Benchmark]: Boogie Procedure Inliner took 126.90ms. Allocated memory is still 148.9MB. Free memory was 87.0MB in the beginning and 74.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-17 19:43:54,649 INFO L158 Benchmark]: Boogie Preprocessor took 153.14ms. Allocated memory is still 148.9MB. Free memory was 74.5MB in the beginning and 61.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-17 19:43:54,650 INFO L158 Benchmark]: RCFGBuilder took 2011.21ms. Allocated memory was 148.9MB in the beginning and 190.8MB in the end (delta: 41.9MB). Free memory was 61.8MB in the beginning and 59.8MB in the end (delta: 2.0MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-09-17 19:43:54,650 INFO L158 Benchmark]: TraceAbstraction took 29434.49ms. Allocated memory was 190.8MB in the beginning and 977.3MB in the end (delta: 786.4MB). Free memory was 59.8MB in the beginning and 733.7MB in the end (delta: -673.9MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. [2024-09-17 19:43:54,651 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.17ms. Allocated memory is still 109.1MB. Free memory was 82.0MB in the beginning and 81.9MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.10ms. Allocated memory is still 109.1MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1187.07ms. Allocated memory is still 148.9MB. Free memory was 116.2MB in the beginning and 87.0MB in the end (delta: 29.2MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 126.90ms. Allocated memory is still 148.9MB. Free memory was 87.0MB in the beginning and 74.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 153.14ms. Allocated memory is still 148.9MB. Free memory was 74.5MB in the beginning and 61.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2011.21ms. Allocated memory was 148.9MB in the beginning and 190.8MB in the end (delta: 41.9MB). Free memory was 61.8MB in the beginning and 59.8MB in the end (delta: 2.0MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 29434.49ms. Allocated memory was 190.8MB in the beginning and 977.3MB in the end (delta: 786.4MB). Free memory was 59.8MB in the beginning and 733.7MB in the end (delta: -673.9MB). Peak memory consumption was 111.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: 31]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 41]: 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: 53]: 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: 68]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 128]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 264]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 335]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 360]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 404]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 475]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 4665]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 4678]: 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: 4690]: 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: 4714]: 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: 4726]: 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: 4734]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 4743]: 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: 4755]: 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: 4770]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 4783]: 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: 4795]: 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: 4811]: 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: 4823]: 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: 4854]: 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: 4866]: 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: 4893]: 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: 4905]: 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, 497 locations, 27 error locations. Started 1 CEGAR loops. OverallTime: 29.4s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2737 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2737 mSDsluCounter, 7319 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3431 mSDsCounter, 1031 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13273 IncrementalHoareTripleChecker+Invalid, 14304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1031 mSolverCounterUnsat, 3888 mSDtfsCounter, 13273 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 741 GetRequests, 551 SyntacticMatches, 4 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1899 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=497occurred in iteration=0, InterpolantAutomatonStates: 214, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 82 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 4877 NumberOfCodeBlocks, 4877 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 5106 ConstructedInterpolants, 0 QuantifiedInterpolants, 8000 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1248 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 0/9 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 27 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-17 19:43:54,675 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE