./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/gj2007.c.i.p+lhb-reducer.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 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-lit/gj2007.c.i.p+lhb-reducer.c ../results/automizer-verification-files/SV-COMP24_unreach-call/gj2007.c.i.p+lhb-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-5189fb6-m [2024-09-13 05:15:07,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 05:15:07,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 05:15:07,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 05:15:07,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 05:15:07,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 05:15:07,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 05:15:07,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 05:15:07,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 05:15:07,821 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 05:15:07,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 05:15:07,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 05:15:07,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 05:15:07,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 05:15:07,822 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 05:15:07,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 05:15:07,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 05:15:07,823 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 05:15:07,825 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 05:15:07,825 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 05:15:07,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 05:15:07,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 05:15:07,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 05:15:07,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 05:15:07,827 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 05:15:07,827 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 05:15:07,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 05:15:07,827 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 05:15:07,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 05:15:07,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 05:15:07,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 05:15:07,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 05:15:07,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:15:07,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 05:15:07,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 05:15:07,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 05:15:07,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 05:15:07,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 05:15:07,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 05:15:07,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 05:15:07,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 05:15:07,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 05:15:07,834 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 05:15:08,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 05:15:08,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 05:15:08,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 05:15:08,057 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 05:15:08,057 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 05:15:08,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/gj2007.c.i.p+lhb-reducer.yml/witness-2.1.yml [2024-09-13 05:15:08,114 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 05:15:08,114 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 05:15:08,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c [2024-09-13 05:15:09,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 05:15:09,529 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 05:15:09,530 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c [2024-09-13 05:15:09,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/97b50fa60/15692e3f5e2b468a88f1d0d893cbcde7/FLAG20769cba5 [2024-09-13 05:15:09,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/97b50fa60/15692e3f5e2b468a88f1d0d893cbcde7 [2024-09-13 05:15:09,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 05:15:09,551 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 05:15:09,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 05:15:09,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 05:15:09,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 05:15:09,556 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 05:15:08" (1/2) ... [2024-09-13 05:15:09,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e13b77 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:09, skipping insertion in model container [2024-09-13 05:15:09,557 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 05:15:08" (1/2) ... [2024-09-13 05:15:09,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1948517e and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:09, skipping insertion in model container [2024-09-13 05:15:09,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:15:09" (2/2) ... [2024-09-13 05:15:09,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e13b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:09, skipping insertion in model container [2024-09-13 05:15:09,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:15:09" (2/2) ... [2024-09-13 05:15:09,566 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 05:15:09,566 INFO L1541 ArrayList]: Location invariant before [L29-L189] (((main__y == 50) && (main__x <= 2)) && (\old(__return_720) == __return_720)) [2024-09-13 05:15:09,566 INFO L1541 ArrayList]: Location invariant before [L47-L153] (((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 5)) [2024-09-13 05:15:09,567 INFO L1541 ArrayList]: Location invariant before [L65-L117] (((main__x <= 8) && (main__y == 50)) && (\old(__return_720) == __return_720)) [2024-09-13 05:15:09,567 INFO L1541 ArrayList]: Location invariant before [L41-L165] (((main__y == 50) && (main__x <= 4)) && (\old(__return_720) == __return_720)) [2024-09-13 05:15:09,567 INFO L1541 ArrayList]: Location invariant before [L72-L105] (((((((((((((((((((((((((((((((((((((((((((((((((((((89 == main__y) && (89 == main__x)) && (\old(__return_720) == __return_720)) || (((53 == main__y) && (53 == main__x)) && (\old(__return_720) == __return_720))) || (((71 == main__y) && (\old(__return_720) == __return_720)) && (71 == main__x))) || (((79 == main__x) && (79 == main__y)) && (\old(__return_720) == __return_720))) || (((88 == main__y) && (\old(__return_720) == __return_720)) && (88 == main__x))) || (((81 == main__y) && (\old(__return_720) == __return_720)) && (81 == main__x))) || (((100 == main__y) && (100 <= main__x)) && (\old(__return_720) == __return_720))) || (((65 == main__y) && (\old(__return_720) == __return_720)) && (65 == main__x))) || (((main__y == 50) && (main__x <= 50)) && (\old(__return_720) == __return_720))) || (((52 == main__y) && (\old(__return_720) == __return_720)) && (52 == main__x))) || (((74 == main__x) && (\old(__return_720) == __return_720)) && (74 == main__y))) || (((64 == main__x) && (64 == main__y)) && (\old(__return_720) == __return_720))) || (((\old(__return_720) == __return_720) && (main__x == 93)) && (main__y == 93))) || (((\old(__return_720) == __return_720) && (main__x == 80)) && (main__y == 80))) || (((main__y == 86) && (\old(__return_720) == __return_720)) && (main__x == 86))) || (((main__x == 96) && (main__y == 96)) && (\old(__return_720) == __return_720))) || (((87 == main__x) && (\old(__return_720) == __return_720)) && (87 == main__y))) || (((90 == main__x) && (\old(__return_720) == __return_720)) && (90 == main__y))) || (((\old(__return_720) == __return_720) && (92 == main__y)) && (92 == main__x))) || (((60 == main__x) && (60 == main__y)) && (\old(__return_720) == __return_720))) || (((63 == main__x) && (63 == main__y)) && (\old(__return_720) == __return_720))) || (((98 == main__x) && (98 == main__y)) && (\old(__return_720) == __return_720))) || (((59 == main__y) && (\old(__return_720) == __return_720)) && (59 == main__x))) || (((72 == main__x) && (72 == main__y)) && (\old(__return_720) == __return_720))) || (((85 == main__y) && (\old(__return_720) == __return_720)) && (85 == main__x))) || (((73 == main__x) && (\old(__return_720) == __return_720)) && (73 == main__y))) || (((97 == main__x) && (\old(__return_720) == __return_720)) && (97 == main__y))) || (((main__x == 83) && (\old(__return_720) == __return_720)) && (main__y == 83))) || (((main__y == 54) && (main__x == 54)) && (\old(__return_720) == __return_720))) || (((91 == main__y) && (91 == main__x)) && (\old(__return_720) == __return_720))) || (((main__x == 61) && (main__y == 61)) && (\old(__return_720) == __return_720))) || (((58 == main__y) && (\old(__return_720) == __return_720)) && (58 == main__x))) || (((69 == main__y) && (\old(__return_720) == __return_720)) && (69 == main__x))) || (((95 == main__y) && (\old(__return_720) == __return_720)) && (95 == main__x))) || (((56 == main__x) && (\old(__return_720) == __return_720)) && (56 == main__y))) || (((55 == main__x) && (\old(__return_720) == __return_720)) && (55 == main__y))) || (((main__x == 75) && (main__y == 75)) && (\old(__return_720) == __return_720))) || (((68 == main__x) && (\old(__return_720) == __return_720)) && (68 == main__y))) || (((\old(__return_720) == __return_720) && (57 == main__x)) && (57 == main__y))) || (((51 == main__y) && (51 == main__x)) && (\old(__return_720) == __return_720))) || (((66 == main__y) && (66 == main__x)) && (\old(__return_720) == __return_720))) || (((main__y == 99) && (main__x == 99)) && (\old(__return_720) == __return_720))) || (((84 == main__x) && (\old(__return_720) == __return_720)) && (84 == main__y))) || (((67 == main__x) && (67 == main__y)) && (\old(__return_720) == __return_720))) || (((62 == main__x) && (62 == main__y)) && (\old(__return_720) == __return_720))) || (((70 == main__x) && (\old(__return_720) == __return_720)) && (70 == main__y))) || (((94 == main__y) && (94 == main__x)) && (\old(__return_720) == __return_720))) || (((76 == main__y) && (76 == main__x)) && (\old(__return_720) == __return_720))) || (((78 == main__y) && (\old(__return_720) == __return_720)) && (78 == main__x))) || (((82 == main__x) && (\old(__return_720) == __return_720)) && (82 == main__y))) || (((\old(__return_720) == __return_720) && (77 == main__x)) && (77 == main__y))) [2024-09-13 05:15:09,567 INFO L1541 ArrayList]: Location invariant before [L59-L129] (((main__x <= 7) && (main__y == 50)) && (\old(__return_720) == __return_720)) [2024-09-13 05:15:09,567 INFO L1541 ArrayList]: Location invariant before [L23-L201] (((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 1)) [2024-09-13 05:15:09,567 INFO L1541 ArrayList]: Location invariant before [L53-L141] (((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 6)) [2024-09-13 05:15:09,567 INFO L1541 ArrayList]: Location invariant before [L35-L177] (((main__y == 50) && (\old(__return_720) == __return_720)) && (main__x <= 3)) [2024-09-13 05:15:09,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 05:15:09,708 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-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] [2024-09-13 05:15:09,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:15:09,726 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 05:15:09,739 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-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-13 05:15:09,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:15:09,796 INFO L204 MainTranslator]: Completed translation [2024-09-13 05:15:09,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:09 WrapperNode [2024-09-13 05:15:09,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 05:15:09,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 05:15:09,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 05:15:09,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 05:15:09,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:09" (1/1) ... [2024-09-13 05:15:09,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:09" (1/1) ... [2024-09-13 05:15:09,843 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 133 [2024-09-13 05:15:09,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 05:15:09,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 05:15:09,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 05:15:09,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 05:15:09,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:09" (1/1) ... [2024-09-13 05:15:09,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:09" (1/1) ... [2024-09-13 05:15:09,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:09" (1/1) ... [2024-09-13 05:15:09,876 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 05:15:09,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:09" (1/1) ... [2024-09-13 05:15:09,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:09" (1/1) ... [2024-09-13 05:15:09,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:09" (1/1) ... [2024-09-13 05:15:09,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:09" (1/1) ... [2024-09-13 05:15:09,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:09" (1/1) ... [2024-09-13 05:15:09,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:09" (1/1) ... [2024-09-13 05:15:09,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 05:15:09,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 05:15:09,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 05:15:09,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 05:15:09,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:09" (1/1) ... [2024-09-13 05:15:09,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:15:09,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:15:09,932 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 05:15:09,934 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 05:15:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 05:15:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 05:15:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 05:15:09,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 05:15:10,018 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 05:15:10,020 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 05:15:10,242 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-09-13 05:15:10,242 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 05:15:10,283 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 05:15:10,283 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-13 05:15:10,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:15:10 BoogieIcfgContainer [2024-09-13 05:15:10,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 05:15:10,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 05:15:10,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 05:15:10,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 05:15:10,288 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 05:15:08" (1/4) ... [2024-09-13 05:15:10,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d6f1c1 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:15:10, skipping insertion in model container [2024-09-13 05:15:10,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 05:15:09" (2/4) ... [2024-09-13 05:15:10,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d6f1c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:15:10, skipping insertion in model container [2024-09-13 05:15:10,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:09" (3/4) ... [2024-09-13 05:15:10,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d6f1c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:15:10, skipping insertion in model container [2024-09-13 05:15:10,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:15:10" (4/4) ... [2024-09-13 05:15:10,290 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2024-09-13 05:15:10,307 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 05:15:10,307 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-09-13 05:15:10,344 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 05:15:10,351 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;@76b9f1ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 05:15:10,351 INFO L337 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-09-13 05:15:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 43 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-09-13 05:15:10,364 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:10,364 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-09-13 05:15:10,365 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:10,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:10,372 INFO L85 PathProgramCache]: Analyzing trace with hash 5431391, now seen corresponding path program 1 times [2024-09-13 05:15:10,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:10,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432233330] [2024-09-13 05:15:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:10,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:10,516 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 05:15:10,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:10,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432233330] [2024-09-13 05:15:10,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432233330] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:10,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:10,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:15:10,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004617700] [2024-09-13 05:15:10,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:10,525 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:15:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:10,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:15:10,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:15:10,554 INFO L87 Difference]: Start difference. First operand has 44 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 43 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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 05:15:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:10,690 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2024-09-13 05:15:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:15:10,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-09-13 05:15:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:10,699 INFO L225 Difference]: With dead ends: 44 [2024-09-13 05:15:10,699 INFO L226 Difference]: Without dead ends: 42 [2024-09-13 05:15:10,701 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 05:15:10,705 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:10,706 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:15:10,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-13 05:15:10,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-13 05:15:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.59375) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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 05:15:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-09-13 05:15:10,760 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 4 [2024-09-13 05:15:10,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:10,761 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-09-13 05:15:10,765 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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 05:15:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-09-13 05:15:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-09-13 05:15:10,766 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:10,766 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-09-13 05:15:10,766 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 05:15:10,766 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:10,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:10,767 INFO L85 PathProgramCache]: Analyzing trace with hash 5427175, now seen corresponding path program 1 times [2024-09-13 05:15:10,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:10,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912124603] [2024-09-13 05:15:10,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:10,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:10,894 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 05:15:10,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:10,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912124603] [2024-09-13 05:15:10,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912124603] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:10,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:10,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:15:10,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946932938] [2024-09-13 05:15:10,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:10,896 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:15:10,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:10,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:15:10,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:15:10,897 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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 05:15:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:10,982 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-09-13 05:15:10,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:15:10,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-09-13 05:15:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:10,984 INFO L225 Difference]: With dead ends: 41 [2024-09-13 05:15:10,984 INFO L226 Difference]: Without dead ends: 41 [2024-09-13 05:15:10,984 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 05:15:10,985 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:10,985 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:15:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-13 05:15:10,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-13 05:15:10,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.53125) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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 05:15:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-09-13 05:15:10,990 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 4 [2024-09-13 05:15:10,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:10,990 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-09-13 05:15:10,990 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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 05:15:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-09-13 05:15:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-13 05:15:10,992 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:10,993 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:10,993 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 05:15:10,993 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:10,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:10,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1527741893, now seen corresponding path program 1 times [2024-09-13 05:15:10,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:10,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644711052] [2024-09-13 05:15:10,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:10,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:11,097 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 05:15:11,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:11,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644711052] [2024-09-13 05:15:11,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644711052] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:11,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:11,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:11,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818210085] [2024-09-13 05:15:11,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:11,098 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:11,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:11,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:11,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:11,098 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 5 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 05:15:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:11,219 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2024-09-13 05:15:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:11,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 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 05:15:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:11,221 INFO L225 Difference]: With dead ends: 48 [2024-09-13 05:15:11,221 INFO L226 Difference]: Without dead ends: 48 [2024-09-13 05:15:11,222 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 05:15:11,223 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:11,225 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 26 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:15:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-13 05:15:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2024-09-13 05:15:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.46875) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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 05:15:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2024-09-13 05:15:11,228 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 7 [2024-09-13 05:15:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:11,228 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-09-13 05:15:11,228 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 05:15:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2024-09-13 05:15:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-13 05:15:11,229 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:11,229 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:11,231 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 05:15:11,231 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:11,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash 809756185, now seen corresponding path program 1 times [2024-09-13 05:15:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:11,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720175744] [2024-09-13 05:15:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:11,315 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 05:15:11,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:11,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720175744] [2024-09-13 05:15:11,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720175744] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:11,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:11,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:11,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469633790] [2024-09-13 05:15:11,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:11,316 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:11,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:11,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:11,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:11,317 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:11,404 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2024-09-13 05:15:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:11,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-09-13 05:15:11,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:11,405 INFO L225 Difference]: With dead ends: 46 [2024-09-13 05:15:11,405 INFO L226 Difference]: Without dead ends: 46 [2024-09-13 05:15:11,405 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 05:15:11,406 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:11,406 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 22 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:15:11,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-13 05:15:11,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2024-09-13 05:15:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.40625) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 05:15:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-09-13 05:15:11,412 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 10 [2024-09-13 05:15:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:11,412 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-09-13 05:15:11,413 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-09-13 05:15:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-13 05:15:11,413 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:11,413 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:11,413 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 05:15:11,413 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:11,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:11,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1384729537, now seen corresponding path program 1 times [2024-09-13 05:15:11,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:11,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284676412] [2024-09-13 05:15:11,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:11,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:11,482 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 05:15:11,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:11,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284676412] [2024-09-13 05:15:11,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284676412] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:11,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:11,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:11,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063304713] [2024-09-13 05:15:11,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:11,484 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:11,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:11,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:11,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:11,485 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 5 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 05:15:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:11,564 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-09-13 05:15:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:11,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 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 05:15:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:11,565 INFO L225 Difference]: With dead ends: 44 [2024-09-13 05:15:11,565 INFO L226 Difference]: Without dead ends: 44 [2024-09-13 05:15:11,568 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 05:15:11,569 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:11,569 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 22 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:15:11,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-13 05:15:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2024-09-13 05:15:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.34375) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-09-13 05:15:11,575 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 13 [2024-09-13 05:15:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:11,575 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-09-13 05:15:11,575 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 05:15:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-09-13 05:15:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 05:15:11,576 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:11,576 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:11,576 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 05:15:11,576 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:11,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash 683316001, now seen corresponding path program 1 times [2024-09-13 05:15:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:11,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133103724] [2024-09-13 05:15:11,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:11,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:11,672 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 05:15:11,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:11,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133103724] [2024-09-13 05:15:11,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133103724] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:11,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:11,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:11,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484468188] [2024-09-13 05:15:11,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:11,673 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:11,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:11,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:11,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:11,674 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 5 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 05:15:11,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:11,760 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-09-13 05:15:11,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:11,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 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 05:15:11,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:11,762 INFO L225 Difference]: With dead ends: 42 [2024-09-13 05:15:11,762 INFO L226 Difference]: Without dead ends: 42 [2024-09-13 05:15:11,762 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 05:15:11,763 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:11,763 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 20 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:15:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-13 05:15:11,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2024-09-13 05:15:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-09-13 05:15:11,768 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 16 [2024-09-13 05:15:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:11,769 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-09-13 05:15:11,769 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 05:15:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-09-13 05:15:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 05:15:11,769 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:11,769 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 05:15:11,769 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 05:15:11,770 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:11,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:11,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1477912637, now seen corresponding path program 1 times [2024-09-13 05:15:11,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:11,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327577324] [2024-09-13 05:15:11,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:11,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:11,873 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 05:15:11,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:11,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327577324] [2024-09-13 05:15:11,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327577324] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:11,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:11,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:11,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111697945] [2024-09-13 05:15:11,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:11,874 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:11,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:11,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:11,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:11,875 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 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 05:15:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:11,955 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-09-13 05:15:11,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:11,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 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 05:15:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:11,956 INFO L225 Difference]: With dead ends: 40 [2024-09-13 05:15:11,956 INFO L226 Difference]: Without dead ends: 40 [2024-09-13 05:15:11,956 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 05:15:11,956 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:11,957 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 18 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:15:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-13 05:15:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-09-13 05:15:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 05:15:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-09-13 05:15:11,959 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 19 [2024-09-13 05:15:11,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:11,959 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-09-13 05:15:11,959 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 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 05:15:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-09-13 05:15:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-13 05:15:11,960 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:11,960 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:11,960 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 05:15:11,960 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:11,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:11,961 INFO L85 PathProgramCache]: Analyzing trace with hash -785523053, now seen corresponding path program 1 times [2024-09-13 05:15:11,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:11,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069299302] [2024-09-13 05:15:11,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:11,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:12,043 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 05:15:12,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:12,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069299302] [2024-09-13 05:15:12,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069299302] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:12,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:12,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:12,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054486152] [2024-09-13 05:15:12,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:12,044 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:12,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:12,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:12,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:12,045 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:12,107 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-09-13 05:15:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:12,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-09-13 05:15:12,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:12,108 INFO L225 Difference]: With dead ends: 38 [2024-09-13 05:15:12,108 INFO L226 Difference]: Without dead ends: 38 [2024-09-13 05:15:12,108 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 05:15:12,109 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:12,110 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 14 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:15:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-13 05:15:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-09-13 05:15:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-09-13 05:15:12,112 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 22 [2024-09-13 05:15:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:12,112 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-09-13 05:15:12,112 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-09-13 05:15:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-13 05:15:12,113 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:12,113 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] [2024-09-13 05:15:12,114 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 05:15:12,114 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:12,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:12,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1759628423, now seen corresponding path program 1 times [2024-09-13 05:15:12,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:12,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610053908] [2024-09-13 05:15:12,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:12,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:12,187 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 05:15:12,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:12,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610053908] [2024-09-13 05:15:12,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610053908] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:12,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:12,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:12,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511800414] [2024-09-13 05:15:12,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:12,189 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:12,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:12,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:12,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:12,189 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 05:15:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:12,237 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-09-13 05:15:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:12,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-09-13 05:15:12,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:12,238 INFO L225 Difference]: With dead ends: 37 [2024-09-13 05:15:12,238 INFO L226 Difference]: Without dead ends: 37 [2024-09-13 05:15:12,238 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 05:15:12,239 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:12,239 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:15:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-13 05:15:12,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-09-13 05:15:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 05:15:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-09-13 05:15:12,241 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 25 [2024-09-13 05:15:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:12,242 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-09-13 05:15:12,242 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 05:15:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-09-13 05:15:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-13 05:15:12,242 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:12,242 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:12,242 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-13 05:15:12,243 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:12,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:12,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1014616279, now seen corresponding path program 1 times [2024-09-13 05:15:12,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:12,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234877909] [2024-09-13 05:15:12,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:12,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:12,320 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 05:15:12,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:12,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234877909] [2024-09-13 05:15:12,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234877909] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:12,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:12,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:12,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088391874] [2024-09-13 05:15:12,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:12,321 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:12,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:12,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:12,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:12,321 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:12,386 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-09-13 05:15:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:12,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-09-13 05:15:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:12,387 INFO L225 Difference]: With dead ends: 40 [2024-09-13 05:15:12,387 INFO L226 Difference]: Without dead ends: 40 [2024-09-13 05:15:12,387 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 05:15:12,388 INFO L434 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:12,388 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 6 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:15:12,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-13 05:15:12,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-09-13 05:15:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 05:15:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-09-13 05:15:12,391 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 28 [2024-09-13 05:15:12,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:12,391 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-09-13 05:15:12,391 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-09-13 05:15:12,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-13 05:15:12,392 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:12,392 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:12,392 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-13 05:15:12,392 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:12,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:12,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1546137273, now seen corresponding path program 1 times [2024-09-13 05:15:12,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:12,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633902548] [2024-09-13 05:15:12,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:12,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:12,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:12,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633902548] [2024-09-13 05:15:12,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633902548] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:12,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:12,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:15:12,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499439852] [2024-09-13 05:15:12,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:12,491 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:15:12,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:12,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:15:12,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:15:12,492 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:12,529 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2024-09-13 05:15:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:15:12,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-09-13 05:15:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:12,530 INFO L225 Difference]: With dead ends: 40 [2024-09-13 05:15:12,530 INFO L226 Difference]: Without dead ends: 40 [2024-09-13 05:15:12,530 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 05:15:12,531 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:12,532 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 7 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:15:12,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-13 05:15:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-13 05:15:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2024-09-13 05:15:12,536 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 31 [2024-09-13 05:15:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:12,536 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2024-09-13 05:15:12,537 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2024-09-13 05:15:12,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-13 05:15:12,538 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:12,539 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] [2024-09-13 05:15:12,539 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-13 05:15:12,539 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:12,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:12,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1746093260, now seen corresponding path program 1 times [2024-09-13 05:15:12,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:12,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675721566] [2024-09-13 05:15:12,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:12,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:12,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:12,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675721566] [2024-09-13 05:15:12,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675721566] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:15:12,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934805971] [2024-09-13 05:15:12,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:12,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:15:12,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:15:12,764 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 05:15:12,768 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 05:15:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:12,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-13 05:15:12,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:15:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:12,927 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:15:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:13,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934805971] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:15:13,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:15:13,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2024-09-13 05:15:13,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670032402] [2024-09-13 05:15:13,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:15:13,139 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-13 05:15:13,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:13,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-13 05:15:13,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-09-13 05:15:13,143 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 05:15:13,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:13,280 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2024-09-13 05:15:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-13 05:15:13,280 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 0 states have call successors, (0), 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 34 [2024-09-13 05:15:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:13,281 INFO L225 Difference]: With dead ends: 76 [2024-09-13 05:15:13,281 INFO L226 Difference]: Without dead ends: 76 [2024-09-13 05:15:13,281 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-09-13 05:15:13,282 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 46 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:13,282 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 14 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:15:13,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-13 05:15:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-09-13 05:15:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.054054054054054) internal successors, (78), 75 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2024-09-13 05:15:13,286 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 34 [2024-09-13 05:15:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:13,286 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2024-09-13 05:15:13,286 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 05:15:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2024-09-13 05:15:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-13 05:15:13,292 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:13,292 INFO L216 NwaCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 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 05:15:13,306 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 05:15:13,492 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-13 05:15:13,493 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:13,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:13,493 INFO L85 PathProgramCache]: Analyzing trace with hash 961591092, now seen corresponding path program 2 times [2024-09-13 05:15:13,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:13,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314598433] [2024-09-13 05:15:13,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:13,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 14 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:14,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:14,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314598433] [2024-09-13 05:15:14,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314598433] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:15:14,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447114150] [2024-09-13 05:15:14,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 05:15:14,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:15:14,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:15:14,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:15:14,456 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 05:15:14,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 05:15:14,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:15:14,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-13 05:15:14,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:15:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 14 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:14,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:15:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 14 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:15,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447114150] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:15:15,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:15:15,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2024-09-13 05:15:15,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087551160] [2024-09-13 05:15:15,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:15:15,303 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-09-13 05:15:15,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:15,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-09-13 05:15:15,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-09-13 05:15:15,306 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 48 states, 48 states have (on average 2.9791666666666665) internal successors, (143), 48 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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 05:15:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:15,590 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2024-09-13 05:15:15,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-09-13 05:15:15,591 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.9791666666666665) internal successors, (143), 48 states have internal predecessors, (143), 0 states have call successors, (0), 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 70 [2024-09-13 05:15:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:15,592 INFO L225 Difference]: With dead ends: 148 [2024-09-13 05:15:15,592 INFO L226 Difference]: Without dead ends: 148 [2024-09-13 05:15:15,593 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-09-13 05:15:15,593 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:15,593 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 18 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 05:15:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-09-13 05:15:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-09-13 05:15:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 147 states have internal predecessors, (150), 0 states have call successors, (0), 0 states 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 05:15:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2024-09-13 05:15:15,597 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 70 [2024-09-13 05:15:15,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:15,598 INFO L474 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2024-09-13 05:15:15,598 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.9791666666666665) internal successors, (143), 48 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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 05:15:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2024-09-13 05:15:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-09-13 05:15:15,604 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:15,604 INFO L216 NwaCegarLoop]: trace histogram [38, 38, 37, 1, 1, 1, 1, 1, 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 05:15:15,622 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 05:15:15,804 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-13 05:15:15,805 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:15,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash 120500020, now seen corresponding path program 3 times [2024-09-13 05:15:15,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:15,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471759488] [2024-09-13 05:15:15,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:15,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 38 proven. 2109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:19,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:19,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471759488] [2024-09-13 05:15:19,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471759488] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:15:19,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060415220] [2024-09-13 05:15:19,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 05:15:19,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:15:19,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:15:19,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:15:19,217 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 05:15:19,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-13 05:15:19,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:15:19,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-13 05:15:19,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:15:19,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 111 proven. 38 refuted. 0 times theorem prover too weak. 1998 trivial. 0 not checked. [2024-09-13 05:15:19,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:15:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 1998 trivial. 0 not checked. [2024-09-13 05:15:20,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060415220] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:15:20,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:15:20,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 3, 3] total 52 [2024-09-13 05:15:20,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068319163] [2024-09-13 05:15:20,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:15:20,140 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-09-13 05:15:20,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:20,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-09-13 05:15:20,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1184, Invalid=1468, Unknown=0, NotChecked=0, Total=2652 [2024-09-13 05:15:20,141 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand has 52 states, 52 states have (on average 3.480769230769231) internal successors, (181), 52 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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 05:15:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:21,294 INFO L93 Difference]: Finished difference Result 154 states and 156 transitions. [2024-09-13 05:15:21,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-09-13 05:15:21,294 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.480769230769231) internal successors, (181), 52 states have internal predecessors, (181), 0 states have call successors, (0), 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 142 [2024-09-13 05:15:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:21,295 INFO L225 Difference]: With dead ends: 154 [2024-09-13 05:15:21,295 INFO L226 Difference]: Without dead ends: 154 [2024-09-13 05:15:21,297 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3530, Invalid=5976, Unknown=0, NotChecked=0, Total=9506 [2024-09-13 05:15:21,297 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:21,298 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 05:15:21,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-09-13 05:15:21,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-09-13 05:15:21,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 152 states have (on average 1.0263157894736843) internal successors, (156), 153 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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 05:15:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2024-09-13 05:15:21,307 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 156 transitions. Word has length 142 [2024-09-13 05:15:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:21,308 INFO L474 AbstractCegarLoop]: Abstraction has 154 states and 156 transitions. [2024-09-13 05:15:21,308 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.480769230769231) internal successors, (181), 52 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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 05:15:21,308 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 156 transitions. [2024-09-13 05:15:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-09-13 05:15:21,309 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:21,309 INFO L216 NwaCegarLoop]: trace histogram [40, 40, 38, 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] [2024-09-13 05:15:21,321 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-13 05:15:21,509 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-13 05:15:21,510 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:21,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:21,510 INFO L85 PathProgramCache]: Analyzing trace with hash 858611639, now seen corresponding path program 4 times [2024-09-13 05:15:21,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:21,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278210080] [2024-09-13 05:15:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:21,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 156 proven. 2223 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 05:15:24,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:24,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278210080] [2024-09-13 05:15:24,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278210080] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:15:24,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011832048] [2024-09-13 05:15:24,156 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-13 05:15:24,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:15:24,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:15:24,158 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:15:24,158 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 05:15:24,298 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-13 05:15:24,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:15:24,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-13 05:15:24,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:15:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 156 proven. 2223 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 05:15:24,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:15:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 156 proven. 2223 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 05:15:25,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011832048] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:15:25,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:15:25,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2024-09-13 05:15:25,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026346436] [2024-09-13 05:15:25,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:15:25,314 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-09-13 05:15:25,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:25,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-09-13 05:15:25,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2024-09-13 05:15:25,315 INFO L87 Difference]: Start difference. First operand 154 states and 156 transitions. Second operand has 52 states, 52 states have (on average 3.576923076923077) internal successors, (186), 52 states have internal predecessors, (186), 0 states have call successors, (0), 0 states 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 05:15:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:25,529 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2024-09-13 05:15:25,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-09-13 05:15:25,529 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.576923076923077) internal successors, (186), 52 states have internal predecessors, (186), 0 states have call successors, (0), 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 148 [2024-09-13 05:15:25,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:25,530 INFO L225 Difference]: With dead ends: 163 [2024-09-13 05:15:25,530 INFO L226 Difference]: Without dead ends: 163 [2024-09-13 05:15:25,532 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 247 SyntacticMatches, 46 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2024-09-13 05:15:25,532 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:25,532 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 05:15:25,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-09-13 05:15:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-09-13 05:15:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.0248447204968945) internal successors, (165), 162 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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 05:15:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 165 transitions. [2024-09-13 05:15:25,535 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 165 transitions. Word has length 148 [2024-09-13 05:15:25,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:25,535 INFO L474 AbstractCegarLoop]: Abstraction has 163 states and 165 transitions. [2024-09-13 05:15:25,535 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.576923076923077) internal successors, (186), 52 states have internal predecessors, (186), 0 states have call successors, (0), 0 states 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 05:15:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 165 transitions. [2024-09-13 05:15:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-09-13 05:15:25,536 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:25,536 INFO L216 NwaCegarLoop]: trace histogram [43, 43, 41, 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] [2024-09-13 05:15:25,554 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 05:15:25,737 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:15:25,737 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:25,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1592351193, now seen corresponding path program 5 times [2024-09-13 05:15:25,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:25,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022150997] [2024-09-13 05:15:25,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:25,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:29,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:29,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022150997] [2024-09-13 05:15:29,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022150997] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:15:29,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233104935] [2024-09-13 05:15:29,699 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-13 05:15:29,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:15:29,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:15:29,700 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:15:29,700 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 05:15:29,975 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 44 check-sat command(s) [2024-09-13 05:15:29,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:15:29,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-13 05:15:29,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:15:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 1267 proven. 221 refuted. 0 times theorem prover too weak. 1264 trivial. 0 not checked. [2024-09-13 05:15:30,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:15:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 1301 proven. 189 refuted. 0 times theorem prover too weak. 1262 trivial. 0 not checked. [2024-09-13 05:15:30,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233104935] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:15:30,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:15:30,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 5, 6] total 57 [2024-09-13 05:15:30,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828210] [2024-09-13 05:15:30,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:15:30,568 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-09-13 05:15:30,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:30,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-09-13 05:15:30,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1764, Unknown=0, NotChecked=0, Total=3306 [2024-09-13 05:15:30,569 INFO L87 Difference]: Start difference. First operand 163 states and 165 transitions. Second operand has 58 states, 57 states have (on average 4.035087719298246) internal successors, (230), 58 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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 05:15:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:30,847 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2024-09-13 05:15:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-09-13 05:15:30,848 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 4.035087719298246) internal successors, (230), 58 states have internal predecessors, (230), 0 states have call successors, (0), 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 157 [2024-09-13 05:15:30,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:30,849 INFO L225 Difference]: With dead ends: 172 [2024-09-13 05:15:30,849 INFO L226 Difference]: Without dead ends: 172 [2024-09-13 05:15:30,849 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1542, Invalid=1764, Unknown=0, NotChecked=0, Total=3306 [2024-09-13 05:15:30,850 INFO L434 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:30,850 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 05:15:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-09-13 05:15:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 166. [2024-09-13 05:15:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 164 states have (on average 1.024390243902439) internal successors, (168), 165 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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 05:15:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2024-09-13 05:15:30,853 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 157 [2024-09-13 05:15:30,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:30,853 INFO L474 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2024-09-13 05:15:30,853 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 4.035087719298246) internal successors, (230), 58 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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 05:15:30,853 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2024-09-13 05:15:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-09-13 05:15:30,855 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:30,855 INFO L216 NwaCegarLoop]: trace histogram [44, 44, 41, 3, 1, 1, 1, 1, 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 05:15:30,869 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-13 05:15:31,055 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-13 05:15:31,055 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:31,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:31,056 INFO L85 PathProgramCache]: Analyzing trace with hash 179518036, now seen corresponding path program 6 times [2024-09-13 05:15:31,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:31,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244115970] [2024-09-13 05:15:31,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:31,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:35,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:35,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244115970] [2024-09-13 05:15:35,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244115970] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:15:35,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155472076] [2024-09-13 05:15:35,099 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-13 05:15:35,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:15:35,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:15:35,100 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:15:35,101 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-13 05:15:35,178 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-09-13 05:15:35,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:15:35,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-09-13 05:15:35,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:15:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 170 proven. 87 refuted. 0 times theorem prover too weak. 2625 trivial. 0 not checked. [2024-09-13 05:15:37,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:15:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 2709 trivial. 0 not checked. [2024-09-13 05:15:40,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155472076] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 05:15:40,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:15:40,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [54, 16] total 75 [2024-09-13 05:15:40,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222150027] [2024-09-13 05:15:40,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:40,809 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 05:15:40,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:40,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 05:15:40,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1628, Invalid=4072, Unknown=0, NotChecked=0, Total=5700 [2024-09-13 05:15:40,810 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:42,013 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2024-09-13 05:15:42,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 05:15:42,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2024-09-13 05:15:42,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:42,014 INFO L225 Difference]: With dead ends: 165 [2024-09-13 05:15:42,014 INFO L226 Difference]: Without dead ends: 165 [2024-09-13 05:15:42,015 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2410 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1641, Invalid=4211, Unknown=0, NotChecked=0, Total=5852 [2024-09-13 05:15:42,015 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:42,015 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 27 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:15:42,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-09-13 05:15:42,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2024-09-13 05:15:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.0122699386503067) internal successors, (165), 163 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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 05:15:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2024-09-13 05:15:42,018 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 160 [2024-09-13 05:15:42,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:42,018 INFO L474 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2024-09-13 05:15:42,018 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2024-09-13 05:15:42,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-09-13 05:15:42,019 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:42,019 INFO L216 NwaCegarLoop]: trace histogram [45, 44, 41, 3, 1, 1, 1, 1, 1, 1, 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 05:15:42,032 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-13 05:15:42,220 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-13 05:15:42,220 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-09-13 05:15:42,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:42,221 INFO L85 PathProgramCache]: Analyzing trace with hash 787659123, now seen corresponding path program 1 times [2024-09-13 05:15:42,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:42,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998723759] [2024-09-13 05:15:42,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:42,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2024-09-13 05:15:46,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:46,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998723759] [2024-09-13 05:15:46,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998723759] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:46,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:46,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 05:15:46,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472447361] [2024-09-13 05:15:46,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:46,831 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:15:46,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:46,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:15:46,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:15:46,833 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 05:15:46,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:46,873 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2024-09-13 05:15:46,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:15:46,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 163 [2024-09-13 05:15:46,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:46,873 INFO L225 Difference]: With dead ends: 162 [2024-09-13 05:15:46,873 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 05:15:46,874 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 05:15:46,874 INFO L434 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:46,874 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:15:46,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 05:15:46,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 05:15:46,875 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 05:15:46,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 05:15:46,875 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 163 [2024-09-13 05:15:46,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:46,875 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 05:15:46,875 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 05:15:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 05:15:46,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 05:15:46,880 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 10 remaining) [2024-09-13 05:15:46,880 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 10 remaining) [2024-09-13 05:15:46,880 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 10 remaining) [2024-09-13 05:15:46,880 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 10 remaining) [2024-09-13 05:15:46,880 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 10 remaining) [2024-09-13 05:15:46,881 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 10 remaining) [2024-09-13 05:15:46,881 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 10 remaining) [2024-09-13 05:15:46,881 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 10 remaining) [2024-09-13 05:15:46,881 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 10 remaining) [2024-09-13 05:15:46,881 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2024-09-13 05:15:46,881 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-13 05:15:46,884 INFO L408 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:46,886 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 05:15:46,889 INFO L469 ceAbstractionStarter]: Automizer considered 9 witness invariants [2024-09-13 05:15:46,889 INFO L470 ceAbstractionStarter]: WitnessConsidered=9 [2024-09-13 05:15:46,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 05:15:46 BoogieIcfgContainer [2024-09-13 05:15:46,890 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 05:15:46,890 INFO L158 Benchmark]: Toolchain (without parser) took 37339.62ms. Allocated memory was 153.1MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 122.4MB in the beginning and 576.5MB in the end (delta: -454.1MB). Peak memory consumption was 845.7MB. Max. memory is 16.1GB. [2024-09-13 05:15:46,891 INFO L158 Benchmark]: Witness Parser took 0.20ms. Allocated memory is still 153.1MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:15:46,891 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 153.1MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:15:46,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.57ms. Allocated memory is still 153.1MB. Free memory was 122.4MB in the beginning and 105.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-13 05:15:46,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.37ms. Allocated memory is still 153.1MB. Free memory was 105.6MB in the beginning and 103.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 05:15:46,891 INFO L158 Benchmark]: Boogie Preprocessor took 54.32ms. Allocated memory is still 153.1MB. Free memory was 103.5MB in the beginning and 101.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 05:15:46,891 INFO L158 Benchmark]: RCFGBuilder took 385.14ms. Allocated memory is still 153.1MB. Free memory was 101.4MB in the beginning and 71.5MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-09-13 05:15:46,892 INFO L158 Benchmark]: TraceAbstraction took 36604.95ms. Allocated memory was 153.1MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 70.9MB in the beginning and 576.5MB in the end (delta: -505.6MB). Peak memory consumption was 795.3MB. Max. memory is 16.1GB. [2024-09-13 05:15:46,893 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.20ms. Allocated memory is still 153.1MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.09ms. Allocated memory is still 153.1MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.57ms. Allocated memory is still 153.1MB. Free memory was 122.4MB in the beginning and 105.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.37ms. Allocated memory is still 153.1MB. Free memory was 105.6MB in the beginning and 103.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.32ms. Allocated memory is still 153.1MB. Free memory was 103.5MB in the beginning and 101.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.14ms. Allocated memory is still 153.1MB. Free memory was 101.4MB in the beginning and 71.5MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 36604.95ms. Allocated memory was 153.1MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 70.9MB in the beginning and 576.5MB in the end (delta: -505.6MB). Peak memory consumption was 795.3MB. 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: 23]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 29]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 35]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 41]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 47]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 53]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 59]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 65]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 72]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 96]: 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, 44 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 36.6s, OverallIterations: 18, TraceHistogramMax: 45, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 330 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 330 mSDsluCounter, 327 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 208 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2248 IncrementalHoareTripleChecker+Invalid, 2456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 208 mSolverCounterUnsat, 205 mSDtfsCounter, 2248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1734 GetRequests, 1312 SyntacticMatches, 46 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5474 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=16, InterpolantAutomatonStates: 290, 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, 18 MinimizatonAttempts, 46 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 29.3s InterpolantComputationTime, 1764 NumberOfCodeBlocks, 1536 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 2445 ConstructedInterpolants, 0 QuantifiedInterpolants, 13997 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1491 ConjunctsInSsa, 185 ConjunctsInUnsatCore, 30 InterpolantComputations, 13 PerfectInterpolantSequences, 18362/34286 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 05:15:46,918 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE