./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 1d5fa637 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-dev-1d5fa63-m [2024-09-13 10:12:21,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 10:12:21,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 10:12:21,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 10:12:21,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 10:12:21,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 10:12:21,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 10:12:21,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 10:12:21,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 10:12:21,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 10:12:21,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 10:12:21,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 10:12:21,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 10:12:21,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 10:12:21,402 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 10:12:21,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 10:12:21,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 10:12:21,403 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 10:12:21,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 10:12:21,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 10:12:21,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 10:12:21,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 10:12:21,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 10:12:21,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 10:12:21,407 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 10:12:21,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 10:12:21,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 10:12:21,407 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 10:12:21,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 10:12:21,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 10:12:21,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 10:12:21,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 10:12:21,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:12:21,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 10:12:21,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 10:12:21,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 10:12:21,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 10:12:21,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 10:12:21,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 10:12:21,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 10:12:21,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 10:12:21,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 10:12:21,411 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-13 10:12:21,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 10:12:21,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 10:12:21,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 10:12:21,632 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 10:12:21,633 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 10:12:21,634 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-13 10:12:21,694 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 10:12:21,698 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 10:12:21,699 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-13 10:12:22,947 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 10:12:23,160 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 10:12:23,161 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2024-09-13 10:12:23,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/933a4e3af/4a737060ec35432298500b279ece8330/FLAGf14117280 [2024-09-13 10:12:23,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/933a4e3af/4a737060ec35432298500b279ece8330 [2024-09-13 10:12:23,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 10:12:23,506 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 10:12:23,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 10:12:23,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 10:12:23,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 10:12:23,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:12:21" (1/2) ... [2024-09-13 10:12:23,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b0e37c and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:12:23, skipping insertion in model container [2024-09-13 10:12:23,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:12:21" (1/2) ... [2024-09-13 10:12:23,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@34338158 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:12:23, skipping insertion in model container [2024-09-13 10:12:23,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:12:23" (2/2) ... [2024-09-13 10:12:23,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b0e37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:23, skipping insertion in model container [2024-09-13 10:12:23,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:12:23" (2/2) ... [2024-09-13 10:12:23,543 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 10:12:23,544 INFO L1541 ArrayList]: Location invariant before [L64-L3001] (((main__t == 0) || (1 <= main__t)) && (((long long) main__t + 1) <= main__tagbuf_len)) [2024-09-13 10:12:23,544 INFO L1541 ArrayList]: Location invariant before [L132-L282] ((((long long) main__t + 1) <= main__tagbuf_len) && (1 <= main__t)) [2024-09-13 10:12:23,544 INFO L1541 ArrayList]: Location invariant before [L2591-L2647] ((59 <= main__t) && (((long long) main__t + 1) <= main__tagbuf_len)) [2024-09-13 10:12:23,544 INFO L1541 ArrayList]: Location invariant before [L96-L283] ((1 <= main__t) && (main__t <= main__tagbuf_len)) [2024-09-13 10:12:23,544 INFO L1541 ArrayList]: Location invariant before [L25-L3002] ((0 <= main__t) && (main__t <= main__tagbuf_len)) [2024-09-13 10:12:23,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 10:12:23,709 WARN L247 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-13 10:12:23,713 WARN L247 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-13 10:12:23,715 WARN L247 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-13 10:12:23,717 WARN L247 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-13 10:12:23,719 WARN L247 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-13 10:12:23,720 WARN L247 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-13 10:12:23,721 WARN L247 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-13 10:12:23,722 WARN L247 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-13 10:12:23,723 WARN L247 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-13 10:12:23,724 WARN L247 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-13 10:12:23,725 WARN L247 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-13 10:12:23,726 WARN L247 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-13 10:12:23,729 WARN L247 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-13 10:12:23,730 WARN L247 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-13 10:12:23,887 WARN L247 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-13 10:12:23,890 WARN L247 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-13 10:12:23,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:12:23,918 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 10:12:23,928 WARN L247 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-13 10:12:23,928 WARN L247 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-13 10:12:23,933 WARN L247 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-13 10:12:23,934 WARN L247 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-13 10:12:23,935 WARN L247 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-13 10:12:23,935 WARN L247 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-13 10:12:23,936 WARN L247 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-13 10:12:23,937 WARN L247 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-13 10:12:23,938 WARN L247 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-13 10:12:23,939 WARN L247 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-13 10:12:23,944 WARN L247 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-13 10:12:23,945 WARN L247 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-13 10:12:23,946 WARN L247 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-13 10:12:23,947 WARN L247 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-13 10:12:24,079 WARN L247 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-13 10:12:24,084 WARN L247 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-13 10:12:24,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:12:24,105 INFO L204 MainTranslator]: Completed translation [2024-09-13 10:12:24,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:24 WrapperNode [2024-09-13 10:12:24,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 10:12:24,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 10:12:24,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 10:12:24,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 10:12:24,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:24" (1/1) ... [2024-09-13 10:12:24,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:24" (1/1) ... [2024-09-13 10:12:24,180 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2027 [2024-09-13 10:12:24,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 10:12:24,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 10:12:24,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 10:12:24,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 10:12:24,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:24" (1/1) ... [2024-09-13 10:12:24,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:24" (1/1) ... [2024-09-13 10:12:24,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:24" (1/1) ... [2024-09-13 10:12:24,231 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-13 10:12:24,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:24" (1/1) ... [2024-09-13 10:12:24,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:24" (1/1) ... [2024-09-13 10:12:24,259 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:24" (1/1) ... [2024-09-13 10:12:24,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:24" (1/1) ... [2024-09-13 10:12:24,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:24" (1/1) ... [2024-09-13 10:12:24,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:24" (1/1) ... [2024-09-13 10:12:24,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 10:12:24,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 10:12:24,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 10:12:24,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 10:12:24,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:24" (1/1) ... [2024-09-13 10:12:24,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:12:24,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:12:24,315 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-13 10:12:24,317 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-13 10:12:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 10:12:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 10:12:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 10:12:24,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 10:12:24,469 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 10:12:24,471 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 10:12:25,332 INFO L? ?]: Removed 617 outVars from TransFormulas that were not future-live. [2024-09-13 10:12:25,332 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 10:12:25,375 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 10:12:25,375 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-13 10:12:25,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:12:25 BoogieIcfgContainer [2024-09-13 10:12:25,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 10:12:25,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 10:12:25,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 10:12:25,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 10:12:25,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:12:21" (1/4) ... [2024-09-13 10:12:25,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e475384 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:12:25, skipping insertion in model container [2024-09-13 10:12:25,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 10:12:23" (2/4) ... [2024-09-13 10:12:25,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e475384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:12:25, skipping insertion in model container [2024-09-13 10:12:25,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:24" (3/4) ... [2024-09-13 10:12:25,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e475384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:12:25, skipping insertion in model container [2024-09-13 10:12:25,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:12:25" (4/4) ... [2024-09-13 10:12:25,386 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2024-09-13 10:12:25,399 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 10:12:25,399 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-09-13 10:12:25,437 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 10:12:25,442 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;@430b7021, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 10:12:25,442 INFO L337 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-09-13 10:12:25,446 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-13 10:12:25,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-09-13 10:12:25,451 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:25,452 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-09-13 10:12:25,452 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-13 10:12:25,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:25,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1352700, now seen corresponding path program 1 times [2024-09-13 10:12:25,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:25,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735091556] [2024-09-13 10:12:25,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:25,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:25,653 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-13 10:12:25,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:25,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735091556] [2024-09-13 10:12:25,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735091556] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:25,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:25,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:12:25,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631145756] [2024-09-13 10:12:25,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:25,661 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:12:25,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:25,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:12:25,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:12:25,687 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-13 10:12:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:26,069 INFO L93 Difference]: Finished difference Result 324 states and 569 transitions. [2024-09-13 10:12:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:12:26,072 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-13 10:12:26,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:26,084 INFO L225 Difference]: With dead ends: 324 [2024-09-13 10:12:26,084 INFO L226 Difference]: Without dead ends: 320 [2024-09-13 10:12:26,085 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-13 10:12:26,088 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-13 10:12:26,089 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-13 10:12:26,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-09-13 10:12:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 309. [2024-09-13 10:12:26,123 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-13 10:12:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 432 transitions. [2024-09-13 10:12:26,131 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 432 transitions. Word has length 3 [2024-09-13 10:12:26,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:26,131 INFO L474 AbstractCegarLoop]: Abstraction has 309 states and 432 transitions. [2024-09-13 10:12:26,131 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-13 10:12:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 432 transitions. [2024-09-13 10:12:26,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 10:12:26,132 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:26,132 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 10:12:26,132 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 10:12:26,132 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-13 10:12:26,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:26,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1299948007, now seen corresponding path program 1 times [2024-09-13 10:12:26,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:26,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405803546] [2024-09-13 10:12:26,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:26,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:26,208 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-13 10:12:26,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:26,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405803546] [2024-09-13 10:12:26,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405803546] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:26,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:26,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:26,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738027908] [2024-09-13 10:12:26,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:26,209 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:12:26,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:26,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:12:26,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:12:26,210 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-13 10:12:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:26,499 INFO L93 Difference]: Finished difference Result 319 states and 442 transitions. [2024-09-13 10:12:26,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:26,500 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-13 10:12:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:26,501 INFO L225 Difference]: With dead ends: 319 [2024-09-13 10:12:26,503 INFO L226 Difference]: Without dead ends: 319 [2024-09-13 10:12:26,503 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-13 10:12:26,504 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-13 10:12:26,505 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-13 10:12:26,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-09-13 10:12:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 308. [2024-09-13 10:12:26,520 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-13 10:12:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 431 transitions. [2024-09-13 10:12:26,521 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 431 transitions. Word has length 5 [2024-09-13 10:12:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:26,521 INFO L474 AbstractCegarLoop]: Abstraction has 308 states and 431 transitions. [2024-09-13 10:12:26,521 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-13 10:12:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 431 transitions. [2024-09-13 10:12:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-13 10:12:26,522 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:26,522 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:26,522 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 10:12:26,522 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-13 10:12:26,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:26,522 INFO L85 PathProgramCache]: Analyzing trace with hash -587362208, now seen corresponding path program 1 times [2024-09-13 10:12:26,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:26,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094326008] [2024-09-13 10:12:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:26,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:26,594 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-13 10:12:26,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:26,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094326008] [2024-09-13 10:12:26,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094326008] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:26,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:26,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:26,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912062584] [2024-09-13 10:12:26,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:26,595 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:26,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:26,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:26,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:26,597 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-13 10:12:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:27,000 INFO L93 Difference]: Finished difference Result 306 states and 429 transitions. [2024-09-13 10:12:27,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:27,000 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-13 10:12:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:27,002 INFO L225 Difference]: With dead ends: 306 [2024-09-13 10:12:27,002 INFO L226 Difference]: Without dead ends: 306 [2024-09-13 10:12:27,002 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-13 10:12:27,003 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-13 10:12:27,003 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-13 10:12:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-09-13 10:12:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-09-13 10:12:27,010 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-13 10:12:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 429 transitions. [2024-09-13 10:12:27,011 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 429 transitions. Word has length 7 [2024-09-13 10:12:27,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:27,012 INFO L474 AbstractCegarLoop]: Abstraction has 306 states and 429 transitions. [2024-09-13 10:12:27,012 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-13 10:12:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 429 transitions. [2024-09-13 10:12:27,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-13 10:12:27,012 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:27,012 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:27,013 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 10:12:27,013 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-13 10:12:27,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:27,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1028355210, now seen corresponding path program 1 times [2024-09-13 10:12:27,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:27,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093701410] [2024-09-13 10:12:27,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:27,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:27,086 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-13 10:12:27,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:27,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093701410] [2024-09-13 10:12:27,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093701410] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:27,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:27,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:27,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964124723] [2024-09-13 10:12:27,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:27,089 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:27,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:27,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:27,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:27,090 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-13 10:12:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:27,376 INFO L93 Difference]: Finished difference Result 325 states and 448 transitions. [2024-09-13 10:12:27,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:27,376 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-13 10:12:27,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:27,377 INFO L225 Difference]: With dead ends: 325 [2024-09-13 10:12:27,377 INFO L226 Difference]: Without dead ends: 322 [2024-09-13 10:12:27,378 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-13 10:12:27,378 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-13 10:12:27,378 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-13 10:12:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-09-13 10:12:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 301. [2024-09-13 10:12:27,392 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-13 10:12:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 364 transitions. [2024-09-13 10:12:27,392 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 364 transitions. Word has length 8 [2024-09-13 10:12:27,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:27,392 INFO L474 AbstractCegarLoop]: Abstraction has 301 states and 364 transitions. [2024-09-13 10:12:27,393 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-13 10:12:27,393 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 364 transitions. [2024-09-13 10:12:27,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-13 10:12:27,393 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:27,393 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:27,393 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 10:12:27,393 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-13 10:12:27,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:27,393 INFO L85 PathProgramCache]: Analyzing trace with hash 26859339, now seen corresponding path program 1 times [2024-09-13 10:12:27,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:27,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231693894] [2024-09-13 10:12:27,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:27,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:27,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-13 10:12:27,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:27,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231693894] [2024-09-13 10:12:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231693894] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:27,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:27,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:27,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238283860] [2024-09-13 10:12:27,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:27,459 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:27,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:27,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:27,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:27,460 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-13 10:12:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:27,777 INFO L93 Difference]: Finished difference Result 299 states and 362 transitions. [2024-09-13 10:12:27,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:27,777 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-13 10:12:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:27,778 INFO L225 Difference]: With dead ends: 299 [2024-09-13 10:12:27,778 INFO L226 Difference]: Without dead ends: 299 [2024-09-13 10:12:27,779 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-13 10:12:27,779 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-13 10:12:27,779 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-13 10:12:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-09-13 10:12:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2024-09-13 10:12:27,784 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-13 10:12:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 362 transitions. [2024-09-13 10:12:27,785 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 362 transitions. Word has length 9 [2024-09-13 10:12:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:27,785 INFO L474 AbstractCegarLoop]: Abstraction has 299 states and 362 transitions. [2024-09-13 10:12:27,787 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-13 10:12:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 362 transitions. [2024-09-13 10:12:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-13 10:12:27,788 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:27,788 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:27,788 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 10:12:27,788 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-13 10:12:27,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:27,788 INFO L85 PathProgramCache]: Analyzing trace with hash 832643589, now seen corresponding path program 1 times [2024-09-13 10:12:27,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:27,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201946636] [2024-09-13 10:12:27,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:27,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:27,860 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-13 10:12:27,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:27,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201946636] [2024-09-13 10:12:27,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201946636] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:27,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:27,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:27,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15569524] [2024-09-13 10:12:27,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:27,862 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:27,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:27,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:27,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:27,863 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-13 10:12:28,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:28,090 INFO L93 Difference]: Finished difference Result 316 states and 379 transitions. [2024-09-13 10:12:28,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:28,092 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-13 10:12:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:28,093 INFO L225 Difference]: With dead ends: 316 [2024-09-13 10:12:28,093 INFO L226 Difference]: Without dead ends: 316 [2024-09-13 10:12:28,093 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-13 10:12:28,094 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-13 10:12:28,094 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-13 10:12:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-09-13 10:12:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 302. [2024-09-13 10:12:28,098 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-13 10:12:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 365 transitions. [2024-09-13 10:12:28,099 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 365 transitions. Word has length 10 [2024-09-13 10:12:28,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:28,099 INFO L474 AbstractCegarLoop]: Abstraction has 302 states and 365 transitions. [2024-09-13 10:12:28,099 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-13 10:12:28,099 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 365 transitions. [2024-09-13 10:12:28,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-13 10:12:28,100 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:28,100 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:28,100 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 10:12:28,100 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-13 10:12:28,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:28,101 INFO L85 PathProgramCache]: Analyzing trace with hash 832645040, now seen corresponding path program 1 times [2024-09-13 10:12:28,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:28,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742003633] [2024-09-13 10:12:28,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:28,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:28,165 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-13 10:12:28,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:28,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742003633] [2024-09-13 10:12:28,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742003633] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:28,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:28,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 10:12:28,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884902998] [2024-09-13 10:12:28,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:28,168 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 10:12:28,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:28,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 10:12:28,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-13 10:12:28,169 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-13 10:12:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:28,573 INFO L93 Difference]: Finished difference Result 322 states and 385 transitions. [2024-09-13 10:12:28,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:12:28,574 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-13 10:12:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:28,575 INFO L225 Difference]: With dead ends: 322 [2024-09-13 10:12:28,575 INFO L226 Difference]: Without dead ends: 322 [2024-09-13 10:12:28,575 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-13 10:12:28,575 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-13 10:12:28,575 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-13 10:12:28,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-09-13 10:12:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 303. [2024-09-13 10:12:28,579 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-13 10:12:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 366 transitions. [2024-09-13 10:12:28,580 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 366 transitions. Word has length 10 [2024-09-13 10:12:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:28,580 INFO L474 AbstractCegarLoop]: Abstraction has 303 states and 366 transitions. [2024-09-13 10:12:28,580 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-13 10:12:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 366 transitions. [2024-09-13 10:12:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-13 10:12:28,581 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:28,581 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:28,581 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 10:12:28,581 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-13 10:12:28,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1307971084, now seen corresponding path program 1 times [2024-09-13 10:12:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:28,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078869705] [2024-09-13 10:12:28,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:28,626 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-13 10:12:28,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:28,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078869705] [2024-09-13 10:12:28,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078869705] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:28,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:28,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:12:28,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846047369] [2024-09-13 10:12:28,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:28,627 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:28,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:28,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:28,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:28,628 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-13 10:12:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:28,922 INFO L93 Difference]: Finished difference Result 308 states and 371 transitions. [2024-09-13 10:12:28,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:28,923 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-13 10:12:28,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:28,924 INFO L225 Difference]: With dead ends: 308 [2024-09-13 10:12:28,926 INFO L226 Difference]: Without dead ends: 308 [2024-09-13 10:12:28,926 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-13 10:12:28,927 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-13 10:12:28,927 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-13 10:12:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-09-13 10:12:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2024-09-13 10:12:28,934 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-13 10:12:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 369 transitions. [2024-09-13 10:12:28,935 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 369 transitions. Word has length 12 [2024-09-13 10:12:28,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:28,935 INFO L474 AbstractCegarLoop]: Abstraction has 305 states and 369 transitions. [2024-09-13 10:12:28,935 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-13 10:12:28,935 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 369 transitions. [2024-09-13 10:12:28,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-13 10:12:28,935 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:28,935 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:28,936 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 10:12:28,936 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-13 10:12:28,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:28,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1892341708, now seen corresponding path program 1 times [2024-09-13 10:12:28,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:28,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344997361] [2024-09-13 10:12:28,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:28,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:28,970 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-13 10:12:28,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:28,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344997361] [2024-09-13 10:12:28,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344997361] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:28,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:28,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:28,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152732316] [2024-09-13 10:12:28,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:28,971 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:28,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:28,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:28,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:28,972 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-13 10:12:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:29,257 INFO L93 Difference]: Finished difference Result 303 states and 367 transitions. [2024-09-13 10:12:29,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:29,257 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-13 10:12:29,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:29,258 INFO L225 Difference]: With dead ends: 303 [2024-09-13 10:12:29,258 INFO L226 Difference]: Without dead ends: 303 [2024-09-13 10:12:29,259 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-13 10:12:29,259 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:29,259 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.3s Time] [2024-09-13 10:12:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-09-13 10:12:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2024-09-13 10:12:29,263 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-13 10:12:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 367 transitions. [2024-09-13 10:12:29,263 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 367 transitions. Word has length 13 [2024-09-13 10:12:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:29,263 INFO L474 AbstractCegarLoop]: Abstraction has 303 states and 367 transitions. [2024-09-13 10:12:29,264 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-13 10:12:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 367 transitions. [2024-09-13 10:12:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-13 10:12:29,264 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:29,264 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:29,264 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-13 10:12:29,264 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-13 10:12:29,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:29,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1466945095, now seen corresponding path program 1 times [2024-09-13 10:12:29,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:29,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242002153] [2024-09-13 10:12:29,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:29,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:29,307 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-13 10:12:29,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:29,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242002153] [2024-09-13 10:12:29,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242002153] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:29,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:29,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:29,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141564871] [2024-09-13 10:12:29,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:29,308 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:29,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:29,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:29,309 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-13 10:12:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:29,508 INFO L93 Difference]: Finished difference Result 315 states and 379 transitions. [2024-09-13 10:12:29,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:29,508 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-13 10:12:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:29,509 INFO L225 Difference]: With dead ends: 315 [2024-09-13 10:12:29,509 INFO L226 Difference]: Without dead ends: 313 [2024-09-13 10:12:29,509 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-13 10:12:29,510 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-13 10:12:29,510 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-13 10:12:29,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-09-13 10:12:29,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 299. [2024-09-13 10:12:29,514 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-13 10:12:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 363 transitions. [2024-09-13 10:12:29,514 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 363 transitions. Word has length 14 [2024-09-13 10:12:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:29,514 INFO L474 AbstractCegarLoop]: Abstraction has 299 states and 363 transitions. [2024-09-13 10:12:29,515 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-13 10:12:29,515 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 363 transitions. [2024-09-13 10:12:29,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-13 10:12:29,515 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:29,515 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:29,515 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-13 10:12:29,515 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-13 10:12:29,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:29,516 INFO L85 PathProgramCache]: Analyzing trace with hash 18004743, now seen corresponding path program 1 times [2024-09-13 10:12:29,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:29,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926594237] [2024-09-13 10:12:29,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:29,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:29,562 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-13 10:12:29,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:29,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926594237] [2024-09-13 10:12:29,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926594237] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:29,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:29,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 10:12:29,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625102395] [2024-09-13 10:12:29,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:29,563 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:12:29,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:29,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:12:29,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:12:29,564 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-13 10:12:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:29,905 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2024-09-13 10:12:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:12:29,905 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-13 10:12:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:29,906 INFO L225 Difference]: With dead ends: 297 [2024-09-13 10:12:29,906 INFO L226 Difference]: Without dead ends: 297 [2024-09-13 10:12:29,907 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-13 10:12:29,907 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-13 10:12:29,907 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-13 10:12:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-09-13 10:12:29,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2024-09-13 10:12:29,914 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-13 10:12:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 357 transitions. [2024-09-13 10:12:29,914 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 357 transitions. Word has length 14 [2024-09-13 10:12:29,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:29,915 INFO L474 AbstractCegarLoop]: Abstraction has 294 states and 357 transitions. [2024-09-13 10:12:29,915 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-13 10:12:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 357 transitions. [2024-09-13 10:12:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-13 10:12:29,915 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:29,915 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:29,915 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-13 10:12:29,916 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-13 10:12:29,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:29,916 INFO L85 PathProgramCache]: Analyzing trace with hash 18006194, now seen corresponding path program 1 times [2024-09-13 10:12:29,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:29,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839551013] [2024-09-13 10:12:29,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:29,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:30,003 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-13 10:12:30,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:30,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839551013] [2024-09-13 10:12:30,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839551013] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:30,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:30,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 10:12:30,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842517416] [2024-09-13 10:12:30,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:30,005 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 10:12:30,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:30,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 10:12:30,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-13 10:12:30,006 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-13 10:12:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:30,383 INFO L93 Difference]: Finished difference Result 321 states and 387 transitions. [2024-09-13 10:12:30,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 10:12:30,383 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-13 10:12:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:30,384 INFO L225 Difference]: With dead ends: 321 [2024-09-13 10:12:30,384 INFO L226 Difference]: Without dead ends: 321 [2024-09-13 10:12:30,384 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-13 10:12:30,385 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:30,385 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.4s Time] [2024-09-13 10:12:30,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-09-13 10:12:30,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 289. [2024-09-13 10:12:30,388 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-13 10:12:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 352 transitions. [2024-09-13 10:12:30,389 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 352 transitions. Word has length 14 [2024-09-13 10:12:30,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:30,389 INFO L474 AbstractCegarLoop]: Abstraction has 289 states and 352 transitions. [2024-09-13 10:12:30,389 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-13 10:12:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 352 transitions. [2024-09-13 10:12:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 10:12:30,390 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:30,390 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:30,390 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-13 10:12:30,390 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-13 10:12:30,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:30,391 INFO L85 PathProgramCache]: Analyzing trace with hash 689754129, now seen corresponding path program 1 times [2024-09-13 10:12:30,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:30,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416873492] [2024-09-13 10:12:30,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:30,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:30,421 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-13 10:12:30,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:30,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416873492] [2024-09-13 10:12:30,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416873492] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:30,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:30,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:30,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065284460] [2024-09-13 10:12:30,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:30,423 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:30,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:30,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:30,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:30,423 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-13 10:12:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:30,694 INFO L93 Difference]: Finished difference Result 287 states and 350 transitions. [2024-09-13 10:12:30,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:30,698 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-13 10:12:30,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:30,699 INFO L225 Difference]: With dead ends: 287 [2024-09-13 10:12:30,699 INFO L226 Difference]: Without dead ends: 287 [2024-09-13 10:12:30,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-13 10:12:30,700 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:30,700 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.3s Time] [2024-09-13 10:12:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-09-13 10:12:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-09-13 10:12:30,705 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-13 10:12:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 350 transitions. [2024-09-13 10:12:30,706 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 350 transitions. Word has length 16 [2024-09-13 10:12:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:30,706 INFO L474 AbstractCegarLoop]: Abstraction has 287 states and 350 transitions. [2024-09-13 10:12:30,706 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-13 10:12:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 350 transitions. [2024-09-13 10:12:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 10:12:30,707 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:30,707 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:30,707 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-13 10:12:30,707 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-13 10:12:30,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:30,708 INFO L85 PathProgramCache]: Analyzing trace with hash 691478033, now seen corresponding path program 1 times [2024-09-13 10:12:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:30,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733658706] [2024-09-13 10:12:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:30,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:30,749 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-13 10:12:30,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:30,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733658706] [2024-09-13 10:12:30,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733658706] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:30,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:30,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:30,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251563159] [2024-09-13 10:12:30,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:30,750 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:30,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:30,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:30,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:30,751 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-13 10:12:31,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:31,056 INFO L93 Difference]: Finished difference Result 285 states and 348 transitions. [2024-09-13 10:12:31,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:31,056 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-13 10:12:31,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:31,057 INFO L225 Difference]: With dead ends: 285 [2024-09-13 10:12:31,057 INFO L226 Difference]: Without dead ends: 285 [2024-09-13 10:12:31,057 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-13 10:12:31,058 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-13 10:12:31,058 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-13 10:12:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-09-13 10:12:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-09-13 10:12:31,061 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-13 10:12:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 348 transitions. [2024-09-13 10:12:31,061 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 348 transitions. Word has length 16 [2024-09-13 10:12:31,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:31,062 INFO L474 AbstractCegarLoop]: Abstraction has 285 states and 348 transitions. [2024-09-13 10:12:31,062 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-13 10:12:31,062 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 348 transitions. [2024-09-13 10:12:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 10:12:31,062 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:31,062 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:31,062 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-13 10:12:31,062 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-13 10:12:31,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:31,063 INFO L85 PathProgramCache]: Analyzing trace with hash -92454355, now seen corresponding path program 1 times [2024-09-13 10:12:31,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:31,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664140078] [2024-09-13 10:12:31,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:31,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:31,098 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-13 10:12:31,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:31,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664140078] [2024-09-13 10:12:31,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664140078] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:31,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:31,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:31,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123964438] [2024-09-13 10:12:31,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:31,099 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:31,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:31,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:31,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:31,100 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-13 10:12:31,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:31,281 INFO L93 Difference]: Finished difference Result 300 states and 363 transitions. [2024-09-13 10:12:31,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:31,282 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-13 10:12:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:31,282 INFO L225 Difference]: With dead ends: 300 [2024-09-13 10:12:31,282 INFO L226 Difference]: Without dead ends: 300 [2024-09-13 10:12:31,283 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-13 10:12:31,283 INFO L434 NwaCegarLoop]: 319 mSDtfsCounter, 28 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 10:12:31,283 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-13 10:12:31,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-09-13 10:12:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 283. [2024-09-13 10:12:31,286 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-13 10:12:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 346 transitions. [2024-09-13 10:12:31,286 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 346 transitions. Word has length 17 [2024-09-13 10:12:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:31,287 INFO L474 AbstractCegarLoop]: Abstraction has 283 states and 346 transitions. [2024-09-13 10:12:31,287 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-13 10:12:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 346 transitions. [2024-09-13 10:12:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 10:12:31,287 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:31,287 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:31,287 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-13 10:12:31,287 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-13 10:12:31,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:31,288 INFO L85 PathProgramCache]: Analyzing trace with hash -90907210, now seen corresponding path program 1 times [2024-09-13 10:12:31,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:31,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065210268] [2024-09-13 10:12:31,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:31,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:31,325 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-13 10:12:31,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:31,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065210268] [2024-09-13 10:12:31,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065210268] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:31,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:31,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:31,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599330624] [2024-09-13 10:12:31,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:31,326 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:31,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:31,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:31,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:31,327 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-13 10:12:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:31,560 INFO L93 Difference]: Finished difference Result 281 states and 344 transitions. [2024-09-13 10:12:31,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:31,560 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-13 10:12:31,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:31,561 INFO L225 Difference]: With dead ends: 281 [2024-09-13 10:12:31,561 INFO L226 Difference]: Without dead ends: 281 [2024-09-13 10:12:31,561 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-13 10:12:31,562 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-13 10:12:31,562 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-13 10:12:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-09-13 10:12:31,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-09-13 10:12:31,564 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-13 10:12:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 344 transitions. [2024-09-13 10:12:31,565 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 344 transitions. Word has length 17 [2024-09-13 10:12:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:31,565 INFO L474 AbstractCegarLoop]: Abstraction has 281 states and 344 transitions. [2024-09-13 10:12:31,565 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-13 10:12:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 344 transitions. [2024-09-13 10:12:31,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 10:12:31,565 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:31,565 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:31,566 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-13 10:12:31,566 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-13 10:12:31,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:31,566 INFO L85 PathProgramCache]: Analyzing trace with hash -39013275, now seen corresponding path program 1 times [2024-09-13 10:12:31,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:31,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184066393] [2024-09-13 10:12:31,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:31,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:12:31,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:31,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184066393] [2024-09-13 10:12:31,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184066393] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:31,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:31,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:31,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374306870] [2024-09-13 10:12:31,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:31,608 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:31,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:31,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:31,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:31,608 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-13 10:12:31,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:31,791 INFO L93 Difference]: Finished difference Result 294 states and 357 transitions. [2024-09-13 10:12:31,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:31,791 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-13 10:12:31,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:31,792 INFO L225 Difference]: With dead ends: 294 [2024-09-13 10:12:31,792 INFO L226 Difference]: Without dead ends: 292 [2024-09-13 10:12:31,792 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-13 10:12:31,793 INFO L434 NwaCegarLoop]: 315 mSDtfsCounter, 26 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 10:12:31,793 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-13 10:12:31,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-09-13 10:12:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 277. [2024-09-13 10:12:31,796 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-13 10:12:31,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 340 transitions. [2024-09-13 10:12:31,797 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 340 transitions. Word has length 17 [2024-09-13 10:12:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:31,797 INFO L474 AbstractCegarLoop]: Abstraction has 277 states and 340 transitions. [2024-09-13 10:12:31,797 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-13 10:12:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 340 transitions. [2024-09-13 10:12:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-13 10:12:31,798 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:31,798 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-13 10:12:31,798 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-13 10:12:31,798 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-13 10:12:31,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1476847947, now seen corresponding path program 1 times [2024-09-13 10:12:31,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:31,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308904743] [2024-09-13 10:12:31,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:31,848 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-13 10:12:31,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:31,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308904743] [2024-09-13 10:12:31,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308904743] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:31,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:31,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:31,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631676427] [2024-09-13 10:12:31,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:31,850 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:31,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:31,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:31,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:31,850 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-13 10:12:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:32,057 INFO L93 Difference]: Finished difference Result 290 states and 353 transitions. [2024-09-13 10:12:32,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:32,057 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-13 10:12:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:32,059 INFO L225 Difference]: With dead ends: 290 [2024-09-13 10:12:32,059 INFO L226 Difference]: Without dead ends: 290 [2024-09-13 10:12:32,060 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-13 10:12:32,061 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-13 10:12:32,061 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-13 10:12:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-09-13 10:12:32,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2024-09-13 10:12:32,064 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-13 10:12:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 343 transitions. [2024-09-13 10:12:32,065 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 343 transitions. Word has length 18 [2024-09-13 10:12:32,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:32,065 INFO L474 AbstractCegarLoop]: Abstraction has 280 states and 343 transitions. [2024-09-13 10:12:32,065 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-13 10:12:32,065 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 343 transitions. [2024-09-13 10:12:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 10:12:32,065 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:32,065 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-13 10:12:32,065 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-13 10:12:32,066 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-13 10:12:32,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1345806352, now seen corresponding path program 1 times [2024-09-13 10:12:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:32,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998304098] [2024-09-13 10:12:32,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:32,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:32,118 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-13 10:12:32,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:32,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998304098] [2024-09-13 10:12:32,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998304098] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:32,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:32,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 10:12:32,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577179344] [2024-09-13 10:12:32,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:32,119 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:12:32,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:32,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:12:32,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:12:32,121 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-13 10:12:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:32,312 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2024-09-13 10:12:32,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:12:32,312 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-13 10:12:32,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:32,313 INFO L225 Difference]: With dead ends: 292 [2024-09-13 10:12:32,313 INFO L226 Difference]: Without dead ends: 292 [2024-09-13 10:12:32,313 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-13 10:12:32,314 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-13 10:12:32,314 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-13 10:12:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-09-13 10:12:32,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 278. [2024-09-13 10:12:32,317 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-13 10:12:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 341 transitions. [2024-09-13 10:12:32,317 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 341 transitions. Word has length 19 [2024-09-13 10:12:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:32,317 INFO L474 AbstractCegarLoop]: Abstraction has 278 states and 341 transitions. [2024-09-13 10:12:32,318 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-13 10:12:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 341 transitions. [2024-09-13 10:12:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-13 10:12:32,318 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:32,318 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-13 10:12:32,318 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-13 10:12:32,318 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-13 10:12:32,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:32,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1229671905, now seen corresponding path program 1 times [2024-09-13 10:12:32,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:32,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611641530] [2024-09-13 10:12:32,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:32,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:32,361 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-13 10:12:32,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:32,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611641530] [2024-09-13 10:12:32,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611641530] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:32,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:32,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:32,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842072909] [2024-09-13 10:12:32,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:32,362 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:32,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:32,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:32,362 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-13 10:12:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:32,529 INFO L93 Difference]: Finished difference Result 286 states and 349 transitions. [2024-09-13 10:12:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:32,530 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-13 10:12:32,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:32,530 INFO L225 Difference]: With dead ends: 286 [2024-09-13 10:12:32,531 INFO L226 Difference]: Without dead ends: 284 [2024-09-13 10:12:32,531 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-13 10:12:32,531 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-13 10:12:32,531 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-13 10:12:32,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-09-13 10:12:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2024-09-13 10:12:32,534 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-13 10:12:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 337 transitions. [2024-09-13 10:12:32,534 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 337 transitions. Word has length 20 [2024-09-13 10:12:32,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:32,535 INFO L474 AbstractCegarLoop]: Abstraction has 274 states and 337 transitions. [2024-09-13 10:12:32,535 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-13 10:12:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 337 transitions. [2024-09-13 10:12:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-13 10:12:32,535 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:32,535 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-13 10:12:32,535 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-13 10:12:32,536 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-13 10:12:32,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:32,536 INFO L85 PathProgramCache]: Analyzing trace with hash 549995719, now seen corresponding path program 1 times [2024-09-13 10:12:32,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:32,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071995214] [2024-09-13 10:12:32,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:32,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:32,579 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-13 10:12:32,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:32,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071995214] [2024-09-13 10:12:32,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071995214] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:32,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:32,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 10:12:32,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844857019] [2024-09-13 10:12:32,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:32,580 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:12:32,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:32,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:12:32,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:12:32,581 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-13 10:12:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:32,838 INFO L93 Difference]: Finished difference Result 272 states and 335 transitions. [2024-09-13 10:12:32,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:12:32,838 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-13 10:12:32,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:32,839 INFO L225 Difference]: With dead ends: 272 [2024-09-13 10:12:32,839 INFO L226 Difference]: Without dead ends: 254 [2024-09-13 10:12:32,839 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-13 10:12:32,840 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.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:32,840 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.2s Time] [2024-09-13 10:12:32,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-09-13 10:12:32,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-09-13 10:12:32,842 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-13 10:12:32,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2024-09-13 10:12:32,843 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 21 [2024-09-13 10:12:32,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:32,843 INFO L474 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2024-09-13 10:12:32,843 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-13 10:12:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2024-09-13 10:12:32,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-09-13 10:12:32,845 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:32,845 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-13 10:12:32,845 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-13 10:12:32,845 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-13 10:12:32,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:32,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1674086528, now seen corresponding path program 1 times [2024-09-13 10:12:32,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:32,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356674028] [2024-09-13 10:12:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:42,289 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-13 10:12:42,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:42,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356674028] [2024-09-13 10:12:42,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356674028] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:42,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:42,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [122] imperfect sequences [] total 122 [2024-09-13 10:12:42,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777996577] [2024-09-13 10:12:42,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:42,290 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2024-09-13 10:12:42,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:42,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2024-09-13 10:12:42,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5438, Invalid=9568, Unknown=0, NotChecked=0, Total=15006 [2024-09-13 10:12:42,296 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-13 10:12:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:42,920 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2024-09-13 10:12:42,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-09-13 10:12:42,922 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-13 10:12:42,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:42,923 INFO L225 Difference]: With dead ends: 253 [2024-09-13 10:12:42,923 INFO L226 Difference]: Without dead ends: 253 [2024-09-13 10:12:42,926 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-13 10:12:42,927 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-13 10:12:42,927 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-13 10:12:42,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-09-13 10:12:42,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-09-13 10:12:42,930 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-13 10:12:42,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2024-09-13 10:12:42,931 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 243 [2024-09-13 10:12:42,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:42,932 INFO L474 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2024-09-13 10:12:42,932 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-13 10:12:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2024-09-13 10:12:42,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-09-13 10:12:42,933 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:42,933 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-13 10:12:42,934 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-13 10:12:42,934 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-13 10:12:42,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:42,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1060417252, now seen corresponding path program 1 times [2024-09-13 10:12:42,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:42,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963698366] [2024-09-13 10:12:42,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:42,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:43,163 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-13 10:12:43,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:43,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963698366] [2024-09-13 10:12:43,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963698366] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:43,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:43,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:43,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147849514] [2024-09-13 10:12:43,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:43,165 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:43,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:43,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:43,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:43,166 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-13 10:12:43,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:43,441 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2024-09-13 10:12:43,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:43,441 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-13 10:12:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:43,442 INFO L225 Difference]: With dead ends: 251 [2024-09-13 10:12:43,442 INFO L226 Difference]: Without dead ends: 251 [2024-09-13 10:12:43,442 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-13 10:12:43,443 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-13 10:12:43,443 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-13 10:12:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-09-13 10:12:43,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-09-13 10:12:43,446 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-13 10:12:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2024-09-13 10:12:43,446 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2024-09-13 10:12:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:43,446 INFO L474 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2024-09-13 10:12:43,447 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-13 10:12:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2024-09-13 10:12:43,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-09-13 10:12:43,448 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:43,448 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-13 10:12:43,448 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-13 10:12:43,449 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-13 10:12:43,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:43,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1486798170, now seen corresponding path program 1 times [2024-09-13 10:12:43,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:43,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221218135] [2024-09-13 10:12:43,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:43,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:43,658 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-13 10:12:43,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:43,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221218135] [2024-09-13 10:12:43,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221218135] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:43,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:43,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:43,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52778487] [2024-09-13 10:12:43,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:43,660 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:43,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:43,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:43,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:43,661 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-13 10:12:43,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:43,853 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2024-09-13 10:12:43,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:43,854 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-13 10:12:43,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:43,855 INFO L225 Difference]: With dead ends: 254 [2024-09-13 10:12:43,855 INFO L226 Difference]: Without dead ends: 254 [2024-09-13 10:12:43,855 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-13 10:12:43,856 INFO L434 NwaCegarLoop]: 240 mSDtfsCounter, 6 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-13 10:12:43,856 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-13 10:12:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-09-13 10:12:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-09-13 10:12:43,858 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-13 10:12:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2024-09-13 10:12:43,859 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 248 [2024-09-13 10:12:43,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:43,859 INFO L474 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2024-09-13 10:12:43,860 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-13 10:12:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2024-09-13 10:12:43,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-09-13 10:12:43,861 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:43,861 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-13 10:12:43,861 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-09-13 10:12:43,862 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-13 10:12:43,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:43,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1217414217, now seen corresponding path program 1 times [2024-09-13 10:12:43,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:43,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990259118] [2024-09-13 10:12:43,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:43,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:44,101 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-13 10:12:44,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:44,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990259118] [2024-09-13 10:12:44,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990259118] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:12:44,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529216712] [2024-09-13 10:12:44,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:44,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:12:44,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:12:44,103 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-13 10:12:44,104 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-13 10:12:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:44,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 10:12:44,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:12:44,442 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-13 10:12:44,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:12:44,484 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-13 10:12:44,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529216712] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:12:44,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:12:44,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-09-13 10:12:44,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972436635] [2024-09-13 10:12:44,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:12:44,485 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 10:12:44,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:44,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 10:12:44,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 10:12:44,486 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-13 10:12:44,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:44,782 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2024-09-13 10:12:44,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:12:44,783 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-13 10:12:44,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:44,783 INFO L225 Difference]: With dead ends: 252 [2024-09-13 10:12:44,783 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 10:12:44,783 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-13 10:12:44,784 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-13 10:12:44,784 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-13 10:12:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 10:12:44,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 10:12:44,785 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-13 10:12:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 10:12:44,785 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 253 [2024-09-13 10:12:44,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:44,785 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 10:12:44,785 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-13 10:12:44,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 10:12:44,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 10:12:44,787 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 21 remaining) [2024-09-13 10:12:44,788 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (19 of 21 remaining) [2024-09-13 10:12:44,788 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (18 of 21 remaining) [2024-09-13 10:12:44,788 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 21 remaining) [2024-09-13 10:12:44,788 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (16 of 21 remaining) [2024-09-13 10:12:44,788 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (15 of 21 remaining) [2024-09-13 10:12:44,788 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 21 remaining) [2024-09-13 10:12:44,788 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (13 of 21 remaining) [2024-09-13 10:12:44,788 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (12 of 21 remaining) [2024-09-13 10:12:44,789 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 21 remaining) [2024-09-13 10:12:44,789 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (10 of 21 remaining) [2024-09-13 10:12:44,789 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (9 of 21 remaining) [2024-09-13 10:12:44,789 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (8 of 21 remaining) [2024-09-13 10:12:44,789 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (7 of 21 remaining) [2024-09-13 10:12:44,789 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (6 of 21 remaining) [2024-09-13 10:12:44,789 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (5 of 21 remaining) [2024-09-13 10:12:44,789 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (4 of 21 remaining) [2024-09-13 10:12:44,789 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (3 of 21 remaining) [2024-09-13 10:12:44,790 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 21 remaining) [2024-09-13 10:12:44,790 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (1 of 21 remaining) [2024-09-13 10:12:44,790 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (0 of 21 remaining) [2024-09-13 10:12:44,804 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 10:12:44,993 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-13 10:12:44,996 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-13 10:12:44,998 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 10:12:44,999 INFO L469 ceAbstractionStarter]: Automizer considered 5 witness invariants [2024-09-13 10:12:44,999 INFO L470 ceAbstractionStarter]: WitnessConsidered=5 [2024-09-13 10:12:45,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 10:12:45 BoogieIcfgContainer [2024-09-13 10:12:45,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 10:12:45,000 INFO L158 Benchmark]: Toolchain (without parser) took 21494.41ms. Allocated memory was 159.4MB in the beginning and 721.4MB in the end (delta: 562.0MB). Free memory was 121.9MB in the beginning and 519.0MB in the end (delta: -397.2MB). Peak memory consumption was 165.7MB. Max. memory is 16.1GB. [2024-09-13 10:12:45,000 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 132.1MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:12:45,000 INFO L158 Benchmark]: CDTParser took 1.36ms. Allocated memory is still 132.1MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:12:45,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 600.10ms. Allocated memory is still 159.4MB. Free memory was 121.9MB in the beginning and 72.5MB in the end (delta: 49.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-09-13 10:12:45,000 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.15ms. Allocated memory is still 159.4MB. Free memory was 72.5MB in the beginning and 65.3MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-13 10:12:45,001 INFO L158 Benchmark]: Boogie Preprocessor took 106.49ms. Allocated memory is still 159.4MB. Free memory was 65.3MB in the beginning and 57.8MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-13 10:12:45,001 INFO L158 Benchmark]: RCFGBuilder took 1087.90ms. Allocated memory is still 159.4MB. Free memory was 56.9MB in the beginning and 69.0MB in the end (delta: -12.1MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2024-09-13 10:12:45,001 INFO L158 Benchmark]: TraceAbstraction took 19622.84ms. Allocated memory was 159.4MB in the beginning and 721.4MB in the end (delta: 562.0MB). Free memory was 67.9MB in the beginning and 519.0MB in the end (delta: -451.1MB). Peak memory consumption was 112.0MB. Max. memory is 16.1GB. [2024-09-13 10:12:45,003 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.16ms. Allocated memory is still 132.1MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 1.36ms. Allocated memory is still 132.1MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 600.10ms. Allocated memory is still 159.4MB. Free memory was 121.9MB in the beginning and 72.5MB in the end (delta: 49.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.15ms. Allocated memory is still 159.4MB. Free memory was 72.5MB in the beginning and 65.3MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.49ms. Allocated memory is still 159.4MB. Free memory was 65.3MB in the beginning and 57.8MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1087.90ms. Allocated memory is still 159.4MB. Free memory was 56.9MB in the beginning and 69.0MB in the end (delta: -12.1MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19622.84ms. Allocated memory was 159.4MB in the beginning and 721.4MB in the end (delta: 562.0MB). Free memory was 67.9MB in the beginning and 519.0MB in the end (delta: -451.1MB). Peak memory consumption was 112.0MB. 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: 19.6s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, 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.5s 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.8s 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-13 10:12:45,026 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