./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/apache-get-tag.i.p+nlh-reducer.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 04d6fb36 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+nlh-reducer.c ../results/automizer-verification-files/SV-COMP24_unreach-call/apache-get-tag.i.p+nlh-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-04d6fb3-m [2024-09-15 20:10:15,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 20:10:15,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 20:10:15,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 20:10:15,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 20:10:15,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 20:10:15,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 20:10:15,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 20:10:15,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 20:10:15,860 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 20:10:15,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 20:10:15,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 20:10:15,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 20:10:15,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 20:10:15,862 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 20:10:15,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 20:10:15,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 20:10:15,862 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 20:10:15,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 20:10:15,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 20:10:15,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 20:10:15,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 20:10:15,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 20:10:15,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 20:10:15,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 20:10:15,870 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 20:10:15,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 20:10:15,870 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 20:10:15,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 20:10:15,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 20:10:15,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 20:10:15,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 20:10:15,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:10:15,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 20:10:15,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 20:10:15,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 20:10:15,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 20:10:15,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 20:10:15,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 20:10:15,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 20:10:15,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 20:10:15,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 20:10:15,873 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-15 20:10:16,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 20:10:16,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 20:10:16,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 20:10:16,134 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-15 20:10:16,134 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-15 20:10:16,135 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+nlh-reducer.yml/witness-2.1.yml [2024-09-15 20:10:16,181 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 20:10:16,181 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 20:10:16,182 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+nlh-reducer.c [2024-09-15 20:10:17,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 20:10:17,626 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 20:10:17,626 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2024-09-15 20:10:17,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5bc303cc2/ecb037f0875c420f839d4ac6ae4be710/FLAG809cef5db [2024-09-15 20:10:18,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5bc303cc2/ecb037f0875c420f839d4ac6ae4be710 [2024-09-15 20:10:18,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 20:10:18,005 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-15 20:10:18,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 20:10:18,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 20:10:18,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 20:10:18,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:10:16" (1/2) ... [2024-09-15 20:10:18,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52bb2cf and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:18, skipping insertion in model container [2024-09-15 20:10:18,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:10:16" (1/2) ... [2024-09-15 20:10:18,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6ef7d255 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:18, skipping insertion in model container [2024-09-15 20:10:18,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:10:18" (2/2) ... [2024-09-15 20:10:18,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52bb2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:18, skipping insertion in model container [2024-09-15 20:10:18,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:10:18" (2/2) ... [2024-09-15 20:10:18,042 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-15 20:10:18,043 INFO L1541 ArrayList]: Location invariant before [L25-L3002] ((0 <= main__t) && (main__t <= main__tagbuf_len)) [2024-09-15 20:10:18,043 INFO L1541 ArrayList]: Location invariant before [L132-L282] ((((long long) main__t + 1) <= main__tagbuf_len) && (1 <= main__t)) [2024-09-15 20:10:18,043 INFO L1541 ArrayList]: Location invariant before [L64-L3001] (((main__t == 0) || (1 <= main__t)) && (((long long) main__t + 1) <= main__tagbuf_len)) [2024-09-15 20:10:18,045 INFO L1541 ArrayList]: Location invariant before [L2591-L2647] ((59 <= main__t) && (((long long) main__t + 1) <= main__tagbuf_len)) [2024-09-15 20:10:18,046 INFO L1541 ArrayList]: Location invariant before [L96-L283] ((1 <= main__t) && (main__t <= main__tagbuf_len)) [2024-09-15 20:10:18,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 20:10:18,247 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+nlh-reducer.c[901,914] [2024-09-15 20:10:18,254 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+nlh-reducer.c[1116,1129] [2024-09-15 20:10:18,258 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+nlh-reducer.c[1625,1638] [2024-09-15 20:10:18,259 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+nlh-reducer.c[1840,1853] [2024-09-15 20:10:18,260 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+nlh-reducer.c[2157,2170] [2024-09-15 20:10:18,262 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+nlh-reducer.c[2372,2385] [2024-09-15 20:10:18,264 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+nlh-reducer.c[2867,2880] [2024-09-15 20:10:18,267 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+nlh-reducer.c[3082,3095] [2024-09-15 20:10:18,268 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+nlh-reducer.c[3384,3397] [2024-09-15 20:10:18,269 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+nlh-reducer.c[3602,3615] [2024-09-15 20:10:18,272 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+nlh-reducer.c[3878,3891] [2024-09-15 20:10:18,273 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+nlh-reducer.c[4096,4109] [2024-09-15 20:10:18,275 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+nlh-reducer.c[4582,4595] [2024-09-15 20:10:18,277 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+nlh-reducer.c[4800,4813] [2024-09-15 20:10:18,460 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+nlh-reducer.c[47686,47699] [2024-09-15 20:10:18,463 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+nlh-reducer.c[47907,47920] [2024-09-15 20:10:18,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:10:18,484 INFO L200 MainTranslator]: Completed pre-run [2024-09-15 20:10:18,494 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+nlh-reducer.c[901,914] [2024-09-15 20:10:18,494 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+nlh-reducer.c[1116,1129] [2024-09-15 20:10:18,499 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+nlh-reducer.c[1625,1638] [2024-09-15 20:10:18,500 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+nlh-reducer.c[1840,1853] [2024-09-15 20:10:18,501 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+nlh-reducer.c[2157,2170] [2024-09-15 20:10:18,501 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+nlh-reducer.c[2372,2385] [2024-09-15 20:10:18,502 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+nlh-reducer.c[2867,2880] [2024-09-15 20:10:18,502 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+nlh-reducer.c[3082,3095] [2024-09-15 20:10:18,503 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+nlh-reducer.c[3384,3397] [2024-09-15 20:10:18,507 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+nlh-reducer.c[3602,3615] [2024-09-15 20:10:18,511 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+nlh-reducer.c[3878,3891] [2024-09-15 20:10:18,512 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+nlh-reducer.c[4096,4109] [2024-09-15 20:10:18,512 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+nlh-reducer.c[4582,4595] [2024-09-15 20:10:18,513 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+nlh-reducer.c[4800,4813] Start Parsing Local Start Parsing Local [2024-09-15 20:10:18,635 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+nlh-reducer.c[47686,47699] [2024-09-15 20:10:18,640 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+nlh-reducer.c[47907,47920] Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-15 20:10:18,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:10:18,684 INFO L204 MainTranslator]: Completed translation [2024-09-15 20:10:18,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:18 WrapperNode [2024-09-15 20:10:18,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 20:10:18,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 20:10:18,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 20:10:18,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 20:10:18,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:18" (1/1) ... [2024-09-15 20:10:18,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:18" (1/1) ... [2024-09-15 20:10:18,767 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2027 [2024-09-15 20:10:18,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 20:10:18,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 20:10:18,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 20:10:18,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 20:10:18,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:18" (1/1) ... [2024-09-15 20:10:18,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:18" (1/1) ... [2024-09-15 20:10:18,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:18" (1/1) ... [2024-09-15 20:10:18,808 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-15 20:10:18,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:18" (1/1) ... [2024-09-15 20:10:18,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:18" (1/1) ... [2024-09-15 20:10:18,833 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:18" (1/1) ... [2024-09-15 20:10:18,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:18" (1/1) ... [2024-09-15 20:10:18,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:18" (1/1) ... [2024-09-15 20:10:18,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:18" (1/1) ... [2024-09-15 20:10:18,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 20:10:18,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 20:10:18,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 20:10:18,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 20:10:18,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:18" (1/1) ... [2024-09-15 20:10:18,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:10:18,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:10:18,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-15 20:10:18,899 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-15 20:10:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 20:10:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-15 20:10:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 20:10:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 20:10:19,102 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 20:10:19,103 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 20:10:19,933 INFO L? ?]: Removed 617 outVars from TransFormulas that were not future-live. [2024-09-15 20:10:19,933 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 20:10:19,973 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 20:10:19,976 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-15 20:10:19,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:10:19 BoogieIcfgContainer [2024-09-15 20:10:19,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 20:10:19,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 20:10:19,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 20:10:19,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 20:10:19,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:10:16" (1/4) ... [2024-09-15 20:10:19,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a4cd9c and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 15.09 08:10:19, skipping insertion in model container [2024-09-15 20:10:19,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 08:10:18" (2/4) ... [2024-09-15 20:10:19,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a4cd9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:10:19, skipping insertion in model container [2024-09-15 20:10:19,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:18" (3/4) ... [2024-09-15 20:10:19,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a4cd9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:10:19, skipping insertion in model container [2024-09-15 20:10:19,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:10:19" (4/4) ... [2024-09-15 20:10:19,985 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2024-09-15 20:10:19,997 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 20:10:19,998 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-09-15 20:10:20,041 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 20:10:20,057 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;@16d3cc1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 20:10:20,057 INFO L337 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-09-15 20:10:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 291 states have (on average 1.9725085910652922) internal successors, (574), 312 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:20,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-09-15 20:10:20,069 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:20,070 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-09-15 20:10:20,071 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:20,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:20,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1352700, now seen corresponding path program 1 times [2024-09-15 20:10:20,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:20,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281375878] [2024-09-15 20:10:20,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:20,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281375878] [2024-09-15 20:10:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281375878] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:20,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 20:10:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219368199] [2024-09-15 20:10:20,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:20,272 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:10:20,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:20,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:10:20,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:10:20,296 INFO L87 Difference]: Start difference. First operand has 313 states, 291 states have (on average 1.9725085910652922) internal successors, (574), 312 states have internal predecessors, (574), 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-15 20:10:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:20,664 INFO L93 Difference]: Finished difference Result 324 states and 569 transitions. [2024-09-15 20:10:20,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:10:20,666 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-15 20:10:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:20,674 INFO L225 Difference]: With dead ends: 324 [2024-09-15 20:10:20,674 INFO L226 Difference]: Without dead ends: 320 [2024-09-15 20:10:20,675 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-15 20:10:20,677 INFO L434 NwaCegarLoop]: 536 mSDtfsCounter, 18 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:20,677 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 756 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:20,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-09-15 20:10:20,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 309. [2024-09-15 20:10:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 289 states have (on average 1.494809688581315) internal successors, (432), 308 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 432 transitions. [2024-09-15 20:10:20,720 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 432 transitions. Word has length 3 [2024-09-15 20:10:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:20,720 INFO L474 AbstractCegarLoop]: Abstraction has 309 states and 432 transitions. [2024-09-15 20:10:20,720 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-15 20:10:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 432 transitions. [2024-09-15 20:10:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-15 20:10:20,723 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:20,723 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-15 20:10:20,724 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 20:10:20,724 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:20,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:20,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1299948007, now seen corresponding path program 1 times [2024-09-15 20:10:20,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:20,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139682200] [2024-09-15 20:10:20,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:20,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:20,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:20,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139682200] [2024-09-15 20:10:20,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139682200] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:20,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:20,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180827125] [2024-09-15 20:10:20,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:20,803 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:20,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:20,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:20,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:20,804 INFO L87 Difference]: Start difference. First operand 309 states and 432 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:21,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:21,114 INFO L93 Difference]: Finished difference Result 319 states and 442 transitions. [2024-09-15 20:10:21,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:21,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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 5 [2024-09-15 20:10:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:21,116 INFO L225 Difference]: With dead ends: 319 [2024-09-15 20:10:21,116 INFO L226 Difference]: Without dead ends: 319 [2024-09-15 20:10:21,116 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:21,117 INFO L434 NwaCegarLoop]: 412 mSDtfsCounter, 38 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:21,117 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 513 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:21,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-09-15 20:10:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 308. [2024-09-15 20:10:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 289 states have (on average 1.491349480968858) internal successors, (431), 307 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 431 transitions. [2024-09-15 20:10:21,127 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 431 transitions. Word has length 5 [2024-09-15 20:10:21,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:21,127 INFO L474 AbstractCegarLoop]: Abstraction has 308 states and 431 transitions. [2024-09-15 20:10:21,127 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 431 transitions. [2024-09-15 20:10:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-15 20:10:21,128 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:21,128 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:21,128 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 20:10:21,128 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:21,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:21,129 INFO L85 PathProgramCache]: Analyzing trace with hash -587362208, now seen corresponding path program 1 times [2024-09-15 20:10:21,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:21,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131132607] [2024-09-15 20:10:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:21,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:21,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:21,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131132607] [2024-09-15 20:10:21,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131132607] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:21,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:21,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:21,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581118410] [2024-09-15 20:10:21,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:21,213 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:21,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:21,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:21,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:21,213 INFO L87 Difference]: Start difference. First operand 308 states and 431 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-15 20:10:21,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:21,614 INFO L93 Difference]: Finished difference Result 306 states and 429 transitions. [2024-09-15 20:10:21,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:21,614 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-15 20:10:21,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:21,615 INFO L225 Difference]: With dead ends: 306 [2024-09-15 20:10:21,616 INFO L226 Difference]: Without dead ends: 306 [2024-09-15 20:10:21,616 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:21,617 INFO L434 NwaCegarLoop]: 99 mSDtfsCounter, 347 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:21,618 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 206 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 20:10:21,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-09-15 20:10:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-09-15 20:10:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 288 states have (on average 1.4895833333333333) internal successors, (429), 305 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 429 transitions. [2024-09-15 20:10:21,632 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 429 transitions. Word has length 7 [2024-09-15 20:10:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:21,633 INFO L474 AbstractCegarLoop]: Abstraction has 306 states and 429 transitions. [2024-09-15 20:10:21,633 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-15 20:10:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 429 transitions. [2024-09-15 20:10:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-15 20:10:21,633 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:21,633 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:21,633 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-15 20:10:21,633 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:21,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:21,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1028355210, now seen corresponding path program 1 times [2024-09-15 20:10:21,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:21,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262568785] [2024-09-15 20:10:21,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:21,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:21,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:21,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262568785] [2024-09-15 20:10:21,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262568785] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:21,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:21,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:21,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669058062] [2024-09-15 20:10:21,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:21,708 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:21,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:21,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:21,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:21,708 INFO L87 Difference]: Start difference. First operand 306 states and 429 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-15 20:10:21,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:21,993 INFO L93 Difference]: Finished difference Result 325 states and 448 transitions. [2024-09-15 20:10:21,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:21,993 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-15 20:10:21,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:21,994 INFO L225 Difference]: With dead ends: 325 [2024-09-15 20:10:21,995 INFO L226 Difference]: Without dead ends: 322 [2024-09-15 20:10:21,995 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-15 20:10:21,995 INFO L434 NwaCegarLoop]: 393 mSDtfsCounter, 44 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:21,996 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 866 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-09-15 20:10:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 301. [2024-09-15 20:10:22,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 284 states have (on average 1.2816901408450705) internal successors, (364), 300 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 364 transitions. [2024-09-15 20:10:22,008 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 364 transitions. Word has length 8 [2024-09-15 20:10:22,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:22,008 INFO L474 AbstractCegarLoop]: Abstraction has 301 states and 364 transitions. [2024-09-15 20:10:22,008 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-15 20:10:22,008 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 364 transitions. [2024-09-15 20:10:22,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-15 20:10:22,009 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:22,009 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:22,009 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-15 20:10:22,009 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:22,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:22,009 INFO L85 PathProgramCache]: Analyzing trace with hash 26859339, now seen corresponding path program 1 times [2024-09-15 20:10:22,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:22,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14625583] [2024-09-15 20:10:22,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:22,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:22,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:22,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14625583] [2024-09-15 20:10:22,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14625583] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:22,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:22,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:22,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963629803] [2024-09-15 20:10:22,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:22,065 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:22,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:22,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:22,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:22,066 INFO L87 Difference]: Start difference. First operand 301 states and 364 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:22,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:22,399 INFO L93 Difference]: Finished difference Result 299 states and 362 transitions. [2024-09-15 20:10:22,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:22,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-09-15 20:10:22,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:22,400 INFO L225 Difference]: With dead ends: 299 [2024-09-15 20:10:22,400 INFO L226 Difference]: Without dead ends: 299 [2024-09-15 20:10:22,400 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:22,401 INFO L434 NwaCegarLoop]: 95 mSDtfsCounter, 281 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:22,401 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 196 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:22,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-09-15 20:10:22,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2024-09-15 20:10:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 283 states have (on average 1.2791519434628975) internal successors, (362), 298 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 362 transitions. [2024-09-15 20:10:22,409 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 362 transitions. Word has length 9 [2024-09-15 20:10:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:22,409 INFO L474 AbstractCegarLoop]: Abstraction has 299 states and 362 transitions. [2024-09-15 20:10:22,409 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 362 transitions. [2024-09-15 20:10:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-15 20:10:22,410 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:22,410 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:22,410 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-15 20:10:22,410 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:22,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:22,410 INFO L85 PathProgramCache]: Analyzing trace with hash 832643589, now seen corresponding path program 1 times [2024-09-15 20:10:22,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:22,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123802111] [2024-09-15 20:10:22,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:22,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:22,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:22,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123802111] [2024-09-15 20:10:22,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123802111] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:22,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:22,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:22,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605858220] [2024-09-15 20:10:22,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:22,459 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:22,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:22,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:22,459 INFO L87 Difference]: Start difference. First operand 299 states and 362 transitions. Second operand has 4 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-15 20:10:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:22,698 INFO L93 Difference]: Finished difference Result 316 states and 379 transitions. [2024-09-15 20:10:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:22,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-15 20:10:22,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:22,699 INFO L225 Difference]: With dead ends: 316 [2024-09-15 20:10:22,699 INFO L226 Difference]: Without dead ends: 316 [2024-09-15 20:10:22,700 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:22,700 INFO L434 NwaCegarLoop]: 331 mSDtfsCounter, 36 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:22,700 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 739 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:10:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-09-15 20:10:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 302. [2024-09-15 20:10:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 286 states have (on average 1.2762237762237763) internal successors, (365), 301 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 365 transitions. [2024-09-15 20:10:22,705 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 365 transitions. Word has length 10 [2024-09-15 20:10:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:22,705 INFO L474 AbstractCegarLoop]: Abstraction has 302 states and 365 transitions. [2024-09-15 20:10:22,705 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-15 20:10:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 365 transitions. [2024-09-15 20:10:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-15 20:10:22,706 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:22,706 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:22,706 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-15 20:10:22,706 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:22,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:22,706 INFO L85 PathProgramCache]: Analyzing trace with hash 832645040, now seen corresponding path program 1 times [2024-09-15 20:10:22,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:22,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265336165] [2024-09-15 20:10:22,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:22,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:22,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:22,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265336165] [2024-09-15 20:10:22,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265336165] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:22,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:22,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:22,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541879557] [2024-09-15 20:10:22,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:22,767 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 20:10:22,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:22,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 20:10:22,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:22,768 INFO L87 Difference]: Start difference. First operand 302 states and 365 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-15 20:10:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:23,130 INFO L93 Difference]: Finished difference Result 322 states and 385 transitions. [2024-09-15 20:10:23,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:23,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-15 20:10:23,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:23,132 INFO L225 Difference]: With dead ends: 322 [2024-09-15 20:10:23,132 INFO L226 Difference]: Without dead ends: 322 [2024-09-15 20:10:23,132 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:23,132 INFO L434 NwaCegarLoop]: 328 mSDtfsCounter, 44 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:23,133 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 594 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 20:10:23,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-09-15 20:10:23,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 303. [2024-09-15 20:10:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 287 states have (on average 1.2752613240418118) internal successors, (366), 302 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 366 transitions. [2024-09-15 20:10:23,137 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 366 transitions. Word has length 10 [2024-09-15 20:10:23,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:23,137 INFO L474 AbstractCegarLoop]: Abstraction has 303 states and 366 transitions. [2024-09-15 20:10:23,137 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-15 20:10:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 366 transitions. [2024-09-15 20:10:23,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-15 20:10:23,137 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:23,137 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:23,138 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-15 20:10:23,138 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:23,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:23,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1307971084, now seen corresponding path program 1 times [2024-09-15 20:10:23,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:23,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241463228] [2024-09-15 20:10:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:23,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:23,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:23,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241463228] [2024-09-15 20:10:23,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241463228] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:23,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:23,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:23,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195079770] [2024-09-15 20:10:23,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:23,169 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:23,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:23,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:23,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:23,169 INFO L87 Difference]: Start difference. First operand 303 states and 366 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:23,453 INFO L93 Difference]: Finished difference Result 308 states and 371 transitions. [2024-09-15 20:10:23,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:23,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-09-15 20:10:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:23,455 INFO L225 Difference]: With dead ends: 308 [2024-09-15 20:10:23,455 INFO L226 Difference]: Without dead ends: 308 [2024-09-15 20:10:23,455 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:23,455 INFO L434 NwaCegarLoop]: 337 mSDtfsCounter, 39 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:23,456 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 479 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-09-15 20:10:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2024-09-15 20:10:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 290 states have (on average 1.2724137931034483) internal successors, (369), 304 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 369 transitions. [2024-09-15 20:10:23,461 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 369 transitions. Word has length 12 [2024-09-15 20:10:23,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:23,462 INFO L474 AbstractCegarLoop]: Abstraction has 305 states and 369 transitions. [2024-09-15 20:10:23,462 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 369 transitions. [2024-09-15 20:10:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-15 20:10:23,462 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:23,463 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:23,463 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-15 20:10:23,463 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:23,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1892341708, now seen corresponding path program 1 times [2024-09-15 20:10:23,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:23,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490342381] [2024-09-15 20:10:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:23,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:23,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490342381] [2024-09-15 20:10:23,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490342381] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:23,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:23,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:23,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847966233] [2024-09-15 20:10:23,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:23,515 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:23,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:23,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:23,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:23,517 INFO L87 Difference]: Start difference. First operand 305 states and 369 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:23,761 INFO L93 Difference]: Finished difference Result 303 states and 367 transitions. [2024-09-15 20:10:23,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:23,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-09-15 20:10:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:23,763 INFO L225 Difference]: With dead ends: 303 [2024-09-15 20:10:23,763 INFO L226 Difference]: Without dead ends: 303 [2024-09-15 20:10:23,763 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:23,763 INFO L434 NwaCegarLoop]: 93 mSDtfsCounter, 282 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 192 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.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:23,764 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 192 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:10:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-09-15 20:10:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2024-09-15 20:10:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 289 states have (on average 1.2698961937716262) internal successors, (367), 302 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 367 transitions. [2024-09-15 20:10:23,768 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 367 transitions. Word has length 13 [2024-09-15 20:10:23,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:23,768 INFO L474 AbstractCegarLoop]: Abstraction has 303 states and 367 transitions. [2024-09-15 20:10:23,768 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:23,768 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 367 transitions. [2024-09-15 20:10:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-15 20:10:23,768 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:23,769 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:23,769 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-15 20:10:23,769 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:23,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:23,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1466945095, now seen corresponding path program 1 times [2024-09-15 20:10:23,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:23,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209361945] [2024-09-15 20:10:23,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:23,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:23,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:23,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209361945] [2024-09-15 20:10:23,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209361945] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:23,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:23,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:23,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828745774] [2024-09-15 20:10:23,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:23,807 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:23,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:23,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:23,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:23,807 INFO L87 Difference]: Start difference. First operand 303 states and 367 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:24,007 INFO L93 Difference]: Finished difference Result 315 states and 379 transitions. [2024-09-15 20:10:24,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:24,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-09-15 20:10:24,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:24,008 INFO L225 Difference]: With dead ends: 315 [2024-09-15 20:10:24,008 INFO L226 Difference]: Without dead ends: 313 [2024-09-15 20:10:24,008 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-15 20:10:24,008 INFO L434 NwaCegarLoop]: 327 mSDtfsCounter, 38 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:24,009 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 730 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:10:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-09-15 20:10:24,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 299. [2024-09-15 20:10:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 286 states have (on average 1.2692307692307692) internal successors, (363), 298 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 363 transitions. [2024-09-15 20:10:24,013 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 363 transitions. Word has length 14 [2024-09-15 20:10:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:24,013 INFO L474 AbstractCegarLoop]: Abstraction has 299 states and 363 transitions. [2024-09-15 20:10:24,013 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 363 transitions. [2024-09-15 20:10:24,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-15 20:10:24,013 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:24,013 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:24,014 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-15 20:10:24,014 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:24,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash 18004743, now seen corresponding path program 1 times [2024-09-15 20:10:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:24,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416824825] [2024-09-15 20:10:24,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:24,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:24,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:24,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416824825] [2024-09-15 20:10:24,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416824825] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:24,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:24,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:24,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244822358] [2024-09-15 20:10:24,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:24,067 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:24,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:24,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:24,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:24,068 INFO L87 Difference]: Start difference. First operand 299 states and 363 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:24,359 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2024-09-15 20:10:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:24,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-09-15 20:10:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:24,361 INFO L225 Difference]: With dead ends: 297 [2024-09-15 20:10:24,361 INFO L226 Difference]: Without dead ends: 297 [2024-09-15 20:10:24,361 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:24,362 INFO L434 NwaCegarLoop]: 89 mSDtfsCounter, 481 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:24,362 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 184 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-09-15 20:10:24,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2024-09-15 20:10:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 282 states have (on average 1.2659574468085106) internal successors, (357), 293 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 357 transitions. [2024-09-15 20:10:24,365 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 357 transitions. Word has length 14 [2024-09-15 20:10:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:24,366 INFO L474 AbstractCegarLoop]: Abstraction has 294 states and 357 transitions. [2024-09-15 20:10:24,366 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 357 transitions. [2024-09-15 20:10:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-15 20:10:24,366 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:24,366 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:24,366 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-15 20:10:24,367 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:24,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:24,367 INFO L85 PathProgramCache]: Analyzing trace with hash 18006194, now seen corresponding path program 1 times [2024-09-15 20:10:24,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:24,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266217527] [2024-09-15 20:10:24,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:24,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:24,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:24,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266217527] [2024-09-15 20:10:24,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266217527] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:24,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:24,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-15 20:10:24,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109398380] [2024-09-15 20:10:24,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:24,452 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 20:10:24,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:24,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 20:10:24,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-15 20:10:24,453 INFO L87 Difference]: Start difference. First operand 294 states and 357 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:24,797 INFO L93 Difference]: Finished difference Result 321 states and 387 transitions. [2024-09-15 20:10:24,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 20:10:24,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-09-15 20:10:24,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:24,798 INFO L225 Difference]: With dead ends: 321 [2024-09-15 20:10:24,798 INFO L226 Difference]: Without dead ends: 321 [2024-09-15 20:10:24,799 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-15 20:10:24,799 INFO L434 NwaCegarLoop]: 103 mSDtfsCounter, 482 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:24,799 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 236 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-09-15 20:10:24,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 289. [2024-09-15 20:10:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 278 states have (on average 1.2661870503597121) internal successors, (352), 288 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 352 transitions. [2024-09-15 20:10:24,804 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 352 transitions. Word has length 14 [2024-09-15 20:10:24,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:24,804 INFO L474 AbstractCegarLoop]: Abstraction has 289 states and 352 transitions. [2024-09-15 20:10:24,804 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:24,804 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 352 transitions. [2024-09-15 20:10:24,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 20:10:24,806 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:24,806 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:24,806 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-15 20:10:24,806 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:24,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:24,806 INFO L85 PathProgramCache]: Analyzing trace with hash 689754129, now seen corresponding path program 1 times [2024-09-15 20:10:24,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:24,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006975838] [2024-09-15 20:10:24,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:24,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:24,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:24,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006975838] [2024-09-15 20:10:24,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006975838] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:24,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:24,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:24,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456119602] [2024-09-15 20:10:24,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:24,847 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:24,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:24,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:24,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:24,848 INFO L87 Difference]: Start difference. First operand 289 states and 352 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:25,107 INFO L93 Difference]: Finished difference Result 287 states and 350 transitions. [2024-09-15 20:10:25,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:25,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-09-15 20:10:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:25,111 INFO L225 Difference]: With dead ends: 287 [2024-09-15 20:10:25,111 INFO L226 Difference]: Without dead ends: 287 [2024-09-15 20:10:25,112 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:25,112 INFO L434 NwaCegarLoop]: 87 mSDtfsCounter, 274 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:25,112 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 178 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:10:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-09-15 20:10:25,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-09-15 20:10:25,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 277 states have (on average 1.263537906137184) internal successors, (350), 286 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 350 transitions. [2024-09-15 20:10:25,116 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 350 transitions. Word has length 16 [2024-09-15 20:10:25,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:25,116 INFO L474 AbstractCegarLoop]: Abstraction has 287 states and 350 transitions. [2024-09-15 20:10:25,116 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:25,116 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 350 transitions. [2024-09-15 20:10:25,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 20:10:25,116 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:25,116 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:25,117 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-15 20:10:25,117 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:25,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:25,117 INFO L85 PathProgramCache]: Analyzing trace with hash 691478033, now seen corresponding path program 1 times [2024-09-15 20:10:25,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:25,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587923797] [2024-09-15 20:10:25,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:25,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:25,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:25,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587923797] [2024-09-15 20:10:25,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587923797] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:25,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:25,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:25,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595816173] [2024-09-15 20:10:25,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:25,146 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:25,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:25,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:25,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:25,147 INFO L87 Difference]: Start difference. First operand 287 states and 350 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:25,424 INFO L93 Difference]: Finished difference Result 285 states and 348 transitions. [2024-09-15 20:10:25,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:25,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-09-15 20:10:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:25,425 INFO L225 Difference]: With dead ends: 285 [2024-09-15 20:10:25,425 INFO L226 Difference]: Without dead ends: 285 [2024-09-15 20:10:25,425 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:25,425 INFO L434 NwaCegarLoop]: 85 mSDtfsCounter, 272 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:25,426 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 174 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-09-15 20:10:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-09-15 20:10:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 348 transitions. [2024-09-15 20:10:25,429 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 348 transitions. Word has length 16 [2024-09-15 20:10:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:25,429 INFO L474 AbstractCegarLoop]: Abstraction has 285 states and 348 transitions. [2024-09-15 20:10:25,429 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 348 transitions. [2024-09-15 20:10:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-15 20:10:25,429 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:25,429 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:25,429 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-15 20:10:25,429 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:25,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:25,430 INFO L85 PathProgramCache]: Analyzing trace with hash -92454355, now seen corresponding path program 1 times [2024-09-15 20:10:25,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:25,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125163199] [2024-09-15 20:10:25,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:25,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:25,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:25,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125163199] [2024-09-15 20:10:25,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125163199] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:25,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:25,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:25,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503523787] [2024-09-15 20:10:25,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:25,470 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:25,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:25,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:25,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:25,470 INFO L87 Difference]: Start difference. First operand 285 states and 348 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:25,676 INFO L93 Difference]: Finished difference Result 300 states and 363 transitions. [2024-09-15 20:10:25,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:25,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-09-15 20:10:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:25,677 INFO L225 Difference]: With dead ends: 300 [2024-09-15 20:10:25,678 INFO L226 Difference]: Without dead ends: 300 [2024-09-15 20:10:25,678 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:25,680 INFO L434 NwaCegarLoop]: 319 mSDtfsCounter, 28 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:25,680 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 712 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:10:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-09-15 20:10:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 283. [2024-09-15 20:10:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 275 states have (on average 1.2581818181818183) internal successors, (346), 282 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 346 transitions. [2024-09-15 20:10:25,683 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 346 transitions. Word has length 17 [2024-09-15 20:10:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:25,683 INFO L474 AbstractCegarLoop]: Abstraction has 283 states and 346 transitions. [2024-09-15 20:10:25,683 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 346 transitions. [2024-09-15 20:10:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-15 20:10:25,684 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:25,684 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:25,684 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-15 20:10:25,684 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:25,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:25,685 INFO L85 PathProgramCache]: Analyzing trace with hash -90907210, now seen corresponding path program 1 times [2024-09-15 20:10:25,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:25,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420953235] [2024-09-15 20:10:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:25,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:25,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-15 20:10:25,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:25,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420953235] [2024-09-15 20:10:25,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420953235] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:25,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:25,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:25,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44748058] [2024-09-15 20:10:25,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:25,726 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:25,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:25,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:25,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:25,726 INFO L87 Difference]: Start difference. First operand 283 states and 346 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:25,950 INFO L93 Difference]: Finished difference Result 281 states and 344 transitions. [2024-09-15 20:10:25,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:25,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-09-15 20:10:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:25,951 INFO L225 Difference]: With dead ends: 281 [2024-09-15 20:10:25,951 INFO L226 Difference]: Without dead ends: 281 [2024-09-15 20:10:25,951 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:25,952 INFO L434 NwaCegarLoop]: 81 mSDtfsCounter, 267 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:25,952 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 166 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:10:25,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-09-15 20:10:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-09-15 20:10:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 274 states have (on average 1.2554744525547445) internal successors, (344), 280 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 344 transitions. [2024-09-15 20:10:25,955 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 344 transitions. Word has length 17 [2024-09-15 20:10:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:25,955 INFO L474 AbstractCegarLoop]: Abstraction has 281 states and 344 transitions. [2024-09-15 20:10:25,955 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 344 transitions. [2024-09-15 20:10:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-15 20:10:25,956 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:25,956 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:25,956 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-15 20:10:25,956 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:25,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:25,956 INFO L85 PathProgramCache]: Analyzing trace with hash -39013275, now seen corresponding path program 1 times [2024-09-15 20:10:25,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:25,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303855191] [2024-09-15 20:10:25,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:25,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:26,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:26,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303855191] [2024-09-15 20:10:26,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303855191] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:26,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:26,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:26,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422603398] [2024-09-15 20:10:26,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:26,001 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:26,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:26,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:26,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:26,002 INFO L87 Difference]: Start difference. First operand 281 states and 344 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:26,221 INFO L93 Difference]: Finished difference Result 294 states and 357 transitions. [2024-09-15 20:10:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:26,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-09-15 20:10:26,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:26,223 INFO L225 Difference]: With dead ends: 294 [2024-09-15 20:10:26,223 INFO L226 Difference]: Without dead ends: 292 [2024-09-15 20:10:26,223 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-15 20:10:26,223 INFO L434 NwaCegarLoop]: 315 mSDtfsCounter, 26 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:26,224 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 700 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:10:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-09-15 20:10:26,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 277. [2024-09-15 20:10:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 271 states have (on average 1.2546125461254614) internal successors, (340), 276 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 340 transitions. [2024-09-15 20:10:26,228 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 340 transitions. Word has length 17 [2024-09-15 20:10:26,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:26,228 INFO L474 AbstractCegarLoop]: Abstraction has 277 states and 340 transitions. [2024-09-15 20:10:26,228 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 340 transitions. [2024-09-15 20:10:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-15 20:10:26,229 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:26,229 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:26,229 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-15 20:10:26,229 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:26,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:26,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1476847947, now seen corresponding path program 1 times [2024-09-15 20:10:26,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:26,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717279965] [2024-09-15 20:10:26,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:26,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:26,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:26,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717279965] [2024-09-15 20:10:26,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717279965] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:26,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:26,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125327467] [2024-09-15 20:10:26,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:26,278 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:26,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:26,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:26,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:26,279 INFO L87 Difference]: Start difference. First operand 277 states and 340 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:26,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:26,481 INFO L93 Difference]: Finished difference Result 290 states and 353 transitions. [2024-09-15 20:10:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:26,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-09-15 20:10:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:26,482 INFO L225 Difference]: With dead ends: 290 [2024-09-15 20:10:26,482 INFO L226 Difference]: Without dead ends: 290 [2024-09-15 20:10:26,482 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:26,483 INFO L434 NwaCegarLoop]: 315 mSDtfsCounter, 22 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:26,483 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 699 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:10:26,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-09-15 20:10:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2024-09-15 20:10:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 274 states have (on average 1.2518248175182483) internal successors, (343), 279 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 343 transitions. [2024-09-15 20:10:26,486 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 343 transitions. Word has length 18 [2024-09-15 20:10:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:26,487 INFO L474 AbstractCegarLoop]: Abstraction has 280 states and 343 transitions. [2024-09-15 20:10:26,487 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 343 transitions. [2024-09-15 20:10:26,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-15 20:10:26,487 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:26,487 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:26,487 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-15 20:10:26,487 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:26,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:26,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1345806352, now seen corresponding path program 1 times [2024-09-15 20:10:26,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:26,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169685063] [2024-09-15 20:10:26,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:26,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:26,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:26,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169685063] [2024-09-15 20:10:26,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169685063] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:26,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:26,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:26,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331533057] [2024-09-15 20:10:26,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:26,531 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:26,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:26,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:26,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:26,532 INFO L87 Difference]: Start difference. First operand 280 states and 343 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:26,724 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2024-09-15 20:10:26,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:26,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2024-09-15 20:10:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:26,725 INFO L225 Difference]: With dead ends: 292 [2024-09-15 20:10:26,725 INFO L226 Difference]: Without dead ends: 292 [2024-09-15 20:10:26,726 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:26,726 INFO L434 NwaCegarLoop]: 321 mSDtfsCounter, 48 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:26,726 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 709 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:10:26,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-09-15 20:10:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 278. [2024-09-15 20:10:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 273 states have (on average 1.249084249084249) internal successors, (341), 277 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 341 transitions. [2024-09-15 20:10:26,729 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 341 transitions. Word has length 19 [2024-09-15 20:10:26,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:26,729 INFO L474 AbstractCegarLoop]: Abstraction has 278 states and 341 transitions. [2024-09-15 20:10:26,730 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 341 transitions. [2024-09-15 20:10:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-15 20:10:26,730 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:26,730 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] [2024-09-15 20:10:26,730 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-15 20:10:26,730 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:26,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:26,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1229671905, now seen corresponding path program 1 times [2024-09-15 20:10:26,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:26,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039297316] [2024-09-15 20:10:26,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:26,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:26,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:26,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039297316] [2024-09-15 20:10:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039297316] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:26,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:26,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:26,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139378382] [2024-09-15 20:10:26,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:26,774 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:26,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:26,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:26,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:26,775 INFO L87 Difference]: Start difference. First operand 278 states and 341 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:26,960 INFO L93 Difference]: Finished difference Result 286 states and 349 transitions. [2024-09-15 20:10:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:26,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-09-15 20:10:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:26,961 INFO L225 Difference]: With dead ends: 286 [2024-09-15 20:10:26,961 INFO L226 Difference]: Without dead ends: 284 [2024-09-15 20:10:26,961 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-15 20:10:26,962 INFO L434 NwaCegarLoop]: 311 mSDtfsCounter, 25 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:26,962 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 690 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:10:26,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-09-15 20:10:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2024-09-15 20:10:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 270 states have (on average 1.2481481481481482) internal successors, (337), 273 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 337 transitions. [2024-09-15 20:10:26,965 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 337 transitions. Word has length 20 [2024-09-15 20:10:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:26,965 INFO L474 AbstractCegarLoop]: Abstraction has 274 states and 337 transitions. [2024-09-15 20:10:26,965 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 337 transitions. [2024-09-15 20:10:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-15 20:10:26,966 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:26,966 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] [2024-09-15 20:10:26,966 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-15 20:10:26,966 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:26,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:26,966 INFO L85 PathProgramCache]: Analyzing trace with hash 549995719, now seen corresponding path program 1 times [2024-09-15 20:10:26,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:26,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150235434] [2024-09-15 20:10:26,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:26,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:27,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:27,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150235434] [2024-09-15 20:10:27,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150235434] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:27,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:27,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:10:27,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592408557] [2024-09-15 20:10:27,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:27,028 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:27,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:27,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:27,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:27,029 INFO L87 Difference]: Start difference. First operand 274 states and 337 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:27,312 INFO L93 Difference]: Finished difference Result 272 states and 335 transitions. [2024-09-15 20:10:27,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:27,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2024-09-15 20:10:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:27,313 INFO L225 Difference]: With dead ends: 272 [2024-09-15 20:10:27,313 INFO L226 Difference]: Without dead ends: 254 [2024-09-15 20:10:27,314 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:27,314 INFO L434 NwaCegarLoop]: 73 mSDtfsCounter, 455 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:27,314 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 146 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-09-15 20:10:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-09-15 20:10:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 251 states have (on average 1.0119521912350598) internal successors, (254), 253 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2024-09-15 20:10:27,317 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 21 [2024-09-15 20:10:27,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:27,317 INFO L474 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2024-09-15 20:10:27,317 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2024-09-15 20:10:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-09-15 20:10:27,319 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:27,319 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-15 20:10:27,319 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-15 20:10:27,319 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:27,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:27,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1674086528, now seen corresponding path program 1 times [2024-09-15 20:10:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:27,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908717640] [2024-09-15 20:10:27,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:27,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:36,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:36,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:36,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908717640] [2024-09-15 20:10:36,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908717640] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:36,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:36,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [122] imperfect sequences [] total 122 [2024-09-15 20:10:36,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053016590] [2024-09-15 20:10:36,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:36,144 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2024-09-15 20:10:36,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:36,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2024-09-15 20:10:36,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5438, Invalid=9568, Unknown=0, NotChecked=0, Total=15006 [2024-09-15 20:10:36,150 INFO L87 Difference]: Start difference. First operand 254 states and 254 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-15 20:10:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:36,707 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2024-09-15 20:10:36,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-09-15 20:10:36,708 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-15 20:10:36,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:36,708 INFO L225 Difference]: With dead ends: 253 [2024-09-15 20:10:36,709 INFO L226 Difference]: Without dead ends: 253 [2024-09-15 20:10:36,711 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1889 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5438, Invalid=9568, Unknown=0, NotChecked=0, Total=15006 [2024-09-15 20:10:36,711 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:36,712 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 15 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-15 20:10:36,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-09-15 20:10:36,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-09-15 20:10:36,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 251 states have (on average 1.0079681274900398) internal successors, (253), 252 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2024-09-15 20:10:36,714 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 243 [2024-09-15 20:10:36,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:36,715 INFO L474 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2024-09-15 20:10:36,715 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-15 20:10:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2024-09-15 20:10:36,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-09-15 20:10:36,716 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:36,717 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-15 20:10:36,717 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-15 20:10:36,717 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:36,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:36,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1060417252, now seen corresponding path program 1 times [2024-09-15 20:10:36,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:36,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155811345] [2024-09-15 20:10:36,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:36,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:36,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:36,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155811345] [2024-09-15 20:10:36,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155811345] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:36,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:36,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:36,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560486800] [2024-09-15 20:10:36,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:36,946 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:36,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:36,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:36,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:36,946 INFO L87 Difference]: Start difference. First operand 253 states and 253 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-15 20:10:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:37,211 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2024-09-15 20:10:37,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:37,211 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-15 20:10:37,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:37,212 INFO L225 Difference]: With dead ends: 251 [2024-09-15 20:10:37,212 INFO L226 Difference]: Without dead ends: 251 [2024-09-15 20:10:37,212 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:37,213 INFO L434 NwaCegarLoop]: 6 mSDtfsCounter, 187 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:37,213 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 12 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:37,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-09-15 20:10:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-09-15 20:10:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.004) internal successors, (251), 250 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-15 20:10:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2024-09-15 20:10:37,216 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2024-09-15 20:10:37,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:37,216 INFO L474 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2024-09-15 20:10:37,216 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-15 20:10:37,216 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2024-09-15 20:10:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-09-15 20:10:37,217 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:37,218 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-15 20:10:37,218 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-15 20:10:37,218 INFO L399 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:37,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:37,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1486798170, now seen corresponding path program 1 times [2024-09-15 20:10:37,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:37,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74643658] [2024-09-15 20:10:37,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:37,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:37,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:37,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74643658] [2024-09-15 20:10:37,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74643658] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:37,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:37,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:10:37,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436872235] [2024-09-15 20:10:37,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:37,388 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:37,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:37,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:37,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:37,389 INFO L87 Difference]: Start difference. First operand 251 states and 251 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-15 20:10:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:37,573 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2024-09-15 20:10:37,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:37,574 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-15 20:10:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:37,574 INFO L225 Difference]: With dead ends: 254 [2024-09-15 20:10:37,575 INFO L226 Difference]: Without dead ends: 254 [2024-09-15 20:10:37,575 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:37,575 INFO L434 NwaCegarLoop]: 240 mSDtfsCounter, 6 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:37,576 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 483 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:10:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-09-15 20:10:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-09-15 20:10:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.0039525691699605) internal successors, (254), 253 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2024-09-15 20:10:37,578 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 248 [2024-09-15 20:10:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:37,579 INFO L474 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2024-09-15 20:10:37,579 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-15 20:10:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2024-09-15 20:10:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-09-15 20:10:37,580 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:37,581 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-15 20:10:37,581 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-09-15 20:10:37,581 INFO L399 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2024-09-15 20:10:37,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1217414217, now seen corresponding path program 1 times [2024-09-15 20:10:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:37,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705951092] [2024-09-15 20:10:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:37,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:37,814 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-15 20:10:37,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:37,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705951092] [2024-09-15 20:10:37,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705951092] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:10:37,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527858721] [2024-09-15 20:10:37,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:37,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:10:37,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:10:37,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 20:10:37,818 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-15 20:10:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:38,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-15 20:10:38,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:10:38,192 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-15 20:10:38,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:10:38,228 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-15 20:10:38,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527858721] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 20:10:38,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 20:10:38,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-09-15 20:10:38,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984932866] [2024-09-15 20:10:38,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 20:10:38,230 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 20:10:38,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:38,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 20:10:38,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:10:38,231 INFO L87 Difference]: Start difference. First operand 254 states and 254 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-15 20:10:38,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:38,525 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2024-09-15 20:10:38,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:38,526 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-15 20:10:38,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:38,526 INFO L225 Difference]: With dead ends: 252 [2024-09-15 20:10:38,526 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 20:10:38,526 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-15 20:10:38,527 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:38,527 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 8 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 20:10:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 20:10:38,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:10:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 20:10:38,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 253 [2024-09-15 20:10:38,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:38,528 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 20:10:38,528 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-15 20:10:38,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 20:10:38,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 20:10:38,530 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 21 remaining) [2024-09-15 20:10:38,530 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (19 of 21 remaining) [2024-09-15 20:10:38,531 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (18 of 21 remaining) [2024-09-15 20:10:38,531 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 21 remaining) [2024-09-15 20:10:38,531 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (16 of 21 remaining) [2024-09-15 20:10:38,531 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (15 of 21 remaining) [2024-09-15 20:10:38,531 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 21 remaining) [2024-09-15 20:10:38,531 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (13 of 21 remaining) [2024-09-15 20:10:38,531 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (12 of 21 remaining) [2024-09-15 20:10:38,532 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 21 remaining) [2024-09-15 20:10:38,532 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (10 of 21 remaining) [2024-09-15 20:10:38,532 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (9 of 21 remaining) [2024-09-15 20:10:38,532 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (8 of 21 remaining) [2024-09-15 20:10:38,532 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (7 of 21 remaining) [2024-09-15 20:10:38,532 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (6 of 21 remaining) [2024-09-15 20:10:38,532 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (5 of 21 remaining) [2024-09-15 20:10:38,532 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (4 of 21 remaining) [2024-09-15 20:10:38,533 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (3 of 21 remaining) [2024-09-15 20:10:38,533 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 21 remaining) [2024-09-15 20:10:38,533 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (1 of 21 remaining) [2024-09-15 20:10:38,533 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (0 of 21 remaining) [2024-09-15 20:10:38,547 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-15 20:10:38,733 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-09-15 20:10:38,736 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:38,738 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 20:10:38,739 INFO L469 ceAbstractionStarter]: Automizer considered 5 witness invariants [2024-09-15 20:10:38,739 INFO L470 ceAbstractionStarter]: WitnessConsidered=5 [2024-09-15 20:10:38,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 08:10:38 BoogieIcfgContainer [2024-09-15 20:10:38,740 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 20:10:38,740 INFO L158 Benchmark]: Toolchain (without parser) took 20735.02ms. Allocated memory was 65.0MB in the beginning and 738.2MB in the end (delta: 673.2MB). Free memory was 30.3MB in the beginning and 553.8MB in the end (delta: -523.4MB). Peak memory consumption was 148.9MB. Max. memory is 16.1GB. [2024-09-15 20:10:38,740 INFO L158 Benchmark]: Witness Parser took 0.09ms. Allocated memory is still 44.0MB. Free memory is still 21.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:10:38,740 INFO L158 Benchmark]: CDTParser took 1.34ms. Allocated memory is still 44.0MB. Free memory is still 27.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:10:38,740 INFO L158 Benchmark]: CACSL2BoogieTranslator took 678.51ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 30.1MB in the beginning and 52.8MB in the end (delta: -22.7MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-09-15 20:10:38,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.42ms. Allocated memory is still 81.8MB. Free memory was 52.8MB in the beginning and 45.3MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-15 20:10:38,741 INFO L158 Benchmark]: Boogie Preprocessor took 85.06ms. Allocated memory is still 81.8MB. Free memory was 45.3MB in the beginning and 37.6MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-15 20:10:38,741 INFO L158 Benchmark]: RCFGBuilder took 1123.45ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 37.6MB in the beginning and 45.7MB in the end (delta: -8.0MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-09-15 20:10:38,741 INFO L158 Benchmark]: TraceAbstraction took 18761.60ms. Allocated memory was 107.0MB in the beginning and 738.2MB in the end (delta: 631.2MB). Free memory was 45.0MB in the beginning and 553.8MB in the end (delta: -508.8MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. [2024-09-15 20:10:38,742 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.09ms. Allocated memory is still 44.0MB. Free memory is still 21.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 1.34ms. Allocated memory is still 44.0MB. Free memory is still 27.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 678.51ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 30.1MB in the beginning and 52.8MB in the end (delta: -22.7MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.42ms. Allocated memory is still 81.8MB. Free memory was 52.8MB in the beginning and 45.3MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.06ms. Allocated memory is still 81.8MB. Free memory was 45.3MB in the beginning and 37.6MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1123.45ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 37.6MB in the beginning and 45.7MB in the end (delta: -8.0MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18761.60ms. Allocated memory was 107.0MB in the beginning and 738.2MB in the end (delta: 631.2MB). Free memory was 45.0MB in the beginning and 553.8MB in the end (delta: -508.8MB). Peak memory consumption was 122.7MB. 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: 25]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 35]: 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: 47]: 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: 64]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 76]: 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: 88]: 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: 96]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 105]: 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: 117]: 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: 132]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 145]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 157]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 173]: 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: 185]: 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: 207]: 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: 219]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 255]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 267]: 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: 2591]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 2604]: 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: 2616]: 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, 313 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4002 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4002 mSDsluCounter, 10383 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5075 mSDsCounter, 1062 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12657 IncrementalHoareTripleChecker+Invalid, 13719 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1062 mSolverCounterUnsat, 5308 mSDtfsCounter, 12657 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 758 GetRequests, 557 SyntacticMatches, 5 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1908 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=0, InterpolantAutomatonStates: 226, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 194 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1524 NumberOfCodeBlocks, 1524 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1750 ConstructedInterpolants, 0 QuantifiedInterpolants, 4459 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1217 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 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 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-15 20:10:38,763 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