./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/gj2007.c.i.p+nlh-reducer.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1d5fa637 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c ../results/automizer-verification-files/SV-COMP24_unreach-call/gj2007.c.i.p+nlh-reducer.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 10:12:54,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 10:12:54,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 10:12:54,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 10:12:54,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 10:12:54,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 10:12:54,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 10:12:54,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 10:12:54,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 10:12:54,651 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 10:12:54,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 10:12:54,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 10:12:54,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 10:12:54,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 10:12:54,652 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 10:12:54,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 10:12:54,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 10:12:54,652 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 10:12:54,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 10:12:54,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 10:12:54,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 10:12:54,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 10:12:54,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 10:12:54,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 10:12:54,657 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 10:12:54,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 10:12:54,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 10:12:54,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 10:12:54,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 10:12:54,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 10:12:54,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 10:12:54,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 10:12:54,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:12:54,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 10:12:54,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 10:12:54,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 10:12:54,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 10:12:54,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 10:12:54,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 10:12:54,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 10:12:54,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 10:12:54,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 10:12:54,662 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-13 10:12:54,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 10:12:54,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 10:12:54,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 10:12:54,880 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 10:12:54,881 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 10:12:54,882 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+nlh-reducer.yml/witness-2.1.yml [2024-09-13 10:12:55,011 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 10:12:55,011 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 10:12:55,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2024-09-13 10:12:56,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 10:12:56,346 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 10:12:56,347 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2024-09-13 10:12:56,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e42be8afb/2ac6f56e2e1141e5a2f86677071d72e8/FLAG59dd84beb [2024-09-13 10:12:56,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e42be8afb/2ac6f56e2e1141e5a2f86677071d72e8 [2024-09-13 10:12:56,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 10:12:56,374 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 10:12:56,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 10:12:56,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 10:12:56,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 10:12:56,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:12:55" (1/2) ... [2024-09-13 10:12:56,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1acb78aa and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:12:56, skipping insertion in model container [2024-09-13 10:12:56,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:12:55" (1/2) ... [2024-09-13 10:12:56,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6de83574 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:12:56, skipping insertion in model container [2024-09-13 10:12:56,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:12:56" (2/2) ... [2024-09-13 10:12:56,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1acb78aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:56, skipping insertion in model container [2024-09-13 10:12:56,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:12:56" (2/2) ... [2024-09-13 10:12:56,412 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 10:12:56,412 INFO L1541 ArrayList]: Location invariant before [L293-L705] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (46 == main__x)) [2024-09-13 10:12:56,412 INFO L1541 ArrayList]: Location invariant before [L83-L1125] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (11 == main__x)) [2024-09-13 10:12:56,413 INFO L1541 ArrayList]: Location invariant before [L161-L969] (((main__x == 24) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,413 INFO L1541 ArrayList]: Location invariant before [L137-L1017] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (20 == main__x)) [2024-09-13 10:12:56,413 INFO L1541 ArrayList]: Location invariant before [L269-L753] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (42 == main__x)) [2024-09-13 10:12:56,413 INFO L1541 ArrayList]: Location invariant before [L407-L477] (((65 == main__y) && (\old(__return_1121) == __return_1121)) && (65 == main__x)) [2024-09-13 10:12:56,413 INFO L1541 ArrayList]: Location invariant before [L257-L777] (((main__y == 50) && (40 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,413 INFO L1541 ArrayList]: Location invariant before [L341-L609] (((main__y == 54) && (main__x == 54)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,413 INFO L1541 ArrayList]: Location invariant before [L377-L537] (((60 == main__x) && (60 == main__y)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,413 INFO L1541 ArrayList]: Location invariant before [L113-L1065] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (16 == main__x)) [2024-09-13 10:12:56,414 INFO L1541 ArrayList]: Location invariant before [L395-L501] (((63 == main__x) && (63 == main__y)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,414 INFO L1541 ArrayList]: Location invariant before [L275-L741] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (43 == main__x)) [2024-09-13 10:12:56,414 INFO L1541 ArrayList]: Location invariant before [L95-L1101] (((13 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,414 INFO L1541 ArrayList]: Location invariant before [L329-L633] (((52 == main__y) && (\old(__return_1121) == __return_1121)) && (52 == main__x)) [2024-09-13 10:12:56,414 INFO L1541 ArrayList]: Location invariant before [L125-L1041] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (18 == main__x)) [2024-09-13 10:12:56,414 INFO L1541 ArrayList]: Location invariant before [L185-L921] (((28 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,414 INFO L1541 ArrayList]: Location invariant before [L191-L909] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (29 == main__x)) [2024-09-13 10:12:56,414 INFO L1541 ArrayList]: Location invariant before [L131-L1029] (((main__y == 50) && (19 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,415 INFO L1541 ArrayList]: Location invariant before [L53-L1185] (((main__y == 50) && (6 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,415 INFO L1541 ArrayList]: Location invariant before [L353-L585] (((56 == main__x) && (\old(__return_1121) == __return_1121)) && (56 == main__y)) [2024-09-13 10:12:56,415 INFO L1541 ArrayList]: Location invariant before [L29-L1233] (((2 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,415 INFO L1541 ArrayList]: Location invariant before [L365-L561] (((58 == main__y) && (\old(__return_1121) == __return_1121)) && (58 == main__x)) [2024-09-13 10:12:56,415 INFO L1541 ArrayList]: Location invariant before [L59-L1173] (((7 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,415 INFO L1541 ArrayList]: Location invariant before [L143-L1005] (((21 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,415 INFO L1541 ArrayList]: Location invariant before [L371-L549] (((59 == main__y) && (\old(__return_1121) == __return_1121)) && (59 == main__x)) [2024-09-13 10:12:56,415 INFO L1541 ArrayList]: Location invariant before [L167-L957] (((25 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,415 INFO L1541 ArrayList]: Location invariant before [L305-L681] (((48 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,415 INFO L1541 ArrayList]: Location invariant before [L203-L885] (((31 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,415 INFO L1541 ArrayList]: Location invariant before [L149-L993] (((22 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,415 INFO L1541 ArrayList]: Location invariant before [L197-L897] (((main__y == 50) && (30 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,416 INFO L1541 ArrayList]: Location invariant before [L420-L453] ((((((((((((((((((((((((((((((((((((74 == main__x) && (\old(__return_1121) == __return_1121)) && (74 == main__y)) || (((76 == main__y) && (76 == main__x)) && (\old(__return_1121) == __return_1121))) || (((73 == main__x) && (\old(__return_1121) == __return_1121)) && (73 == main__y))) || (((81 == main__y) && (\old(__return_1121) == __return_1121)) && (81 == main__x))) || (((87 == main__x) && (\old(__return_1121) == __return_1121)) && (87 == main__y))) || (((68 == main__x) && (\old(__return_1121) == __return_1121)) && (68 == main__y))) || (((97 == main__x) && (\old(__return_1121) == __return_1121)) && (97 == main__y))) || (((\old(__return_1121) == __return_1121) && (main__x == 93)) && (main__y == 93))) || (((\old(__return_1121) == __return_1121) && (77 == main__x)) && (77 == main__y))) || (((90 == main__x) && (\old(__return_1121) == __return_1121)) && (90 == main__y))) || (((95 == main__y) && (\old(__return_1121) == __return_1121)) && (95 == main__x))) || (((89 == main__y) && (89 == main__x)) && (\old(__return_1121) == __return_1121))) || (((98 == main__x) && (98 == main__y)) && (\old(__return_1121) == __return_1121))) || (((\old(__return_1121) == __return_1121) && (92 == main__y)) && (92 == main__x))) || (((main__y == 86) && (\old(__return_1121) == __return_1121)) && (main__x == 86))) || (((72 == main__x) && (72 == main__y)) && (\old(__return_1121) == __return_1121))) || (((79 == main__x) && (79 == main__y)) && (\old(__return_1121) == __return_1121))) || (((main__x == 96) && (main__y == 96)) && (\old(__return_1121) == __return_1121))) || (((84 == main__x) && (\old(__return_1121) == __return_1121)) && (84 == main__y))) || (((main__x == 83) && (\old(__return_1121) == __return_1121)) && (main__y == 83))) || (((78 == main__y) && (\old(__return_1121) == __return_1121)) && (78 == main__x))) || (((82 == main__x) && (\old(__return_1121) == __return_1121)) && (82 == main__y))) || (((main__x == 75) && (main__y == 75)) && (\old(__return_1121) == __return_1121))) || (((\old(__return_1121) == __return_1121) && (main__x == 80)) && (main__y == 80))) || (((main__y == 99) && (main__x == 99)) && (\old(__return_1121) == __return_1121))) || (((100 == main__y) && (100 <= main__x)) && (\old(__return_1121) == __return_1121))) || (((67 == main__x) && (67 == main__y)) && (\old(__return_1121) == __return_1121))) || (((85 == main__y) && (\old(__return_1121) == __return_1121)) && (85 == main__x))) || (((69 == main__y) && (\old(__return_1121) == __return_1121)) && (69 == main__x))) || (((88 == main__y) && (\old(__return_1121) == __return_1121)) && (88 == main__x))) || (((94 == main__y) && (94 == main__x)) && (\old(__return_1121) == __return_1121))) || (((71 == main__y) && (\old(__return_1121) == __return_1121)) && (71 == main__x))) || (((70 == main__x) && (\old(__return_1121) == __return_1121)) && (70 == main__y))) || (((91 == main__y) && (91 == main__x)) && (\old(__return_1121) == __return_1121))) [2024-09-13 10:12:56,416 INFO L1541 ArrayList]: Location invariant before [L413-L465] (((66 == main__y) && (66 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,416 INFO L1541 ArrayList]: Location invariant before [L359-L573] (((\old(__return_1121) == __return_1121) && (57 == main__x)) && (57 == main__y)) [2024-09-13 10:12:56,416 INFO L1541 ArrayList]: Location invariant before [L299-L693] (((main__y == 50) && (47 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,416 INFO L1541 ArrayList]: Location invariant before [L389-L513] (((62 == main__x) && (62 == main__y)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,416 INFO L1541 ArrayList]: Location invariant before [L227-L837] (((35 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,416 INFO L1541 ArrayList]: Location invariant before [L317-L657] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (main__x == 50)) [2024-09-13 10:12:56,417 INFO L1541 ArrayList]: Location invariant before [L233-L825] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (36 == main__x)) [2024-09-13 10:12:56,417 INFO L1541 ArrayList]: Location invariant before [L251-L789] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (39 == main__x)) [2024-09-13 10:12:56,417 INFO L1541 ArrayList]: Location invariant before [L155-L981] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (23 == main__x)) [2024-09-13 10:12:56,417 INFO L1541 ArrayList]: Location invariant before [L89-L1113] (((12 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,417 INFO L1541 ArrayList]: Location invariant before [L23-L1245] (((main__x == 1) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,418 INFO L1541 ArrayList]: Location invariant before [L173-L945] (((26 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,419 INFO L1541 ArrayList]: Location invariant before [L101-L1089] (((14 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,419 INFO L1541 ArrayList]: Location invariant before [L323-L645] (((51 == main__y) && (51 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,419 INFO L1541 ArrayList]: Location invariant before [L77-L1137] (((10 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,419 INFO L1541 ArrayList]: Location invariant before [L383-L525] (((main__x == 61) && (main__y == 61)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,419 INFO L1541 ArrayList]: Location invariant before [L311-L669] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (49 == main__x)) [2024-09-13 10:12:56,419 INFO L1541 ArrayList]: Location invariant before [L65-L1161] (((8 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,419 INFO L1541 ArrayList]: Location invariant before [L263-L765] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (41 == main__x)) [2024-09-13 10:12:56,419 INFO L1541 ArrayList]: Location invariant before [L179-L933] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (main__x == 27)) [2024-09-13 10:12:56,419 INFO L1541 ArrayList]: Location invariant before [L401-L489] (((64 == main__x) && (64 == main__y)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,420 INFO L1541 ArrayList]: Location invariant before [L281-L729] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (44 == main__x)) [2024-09-13 10:12:56,420 INFO L1541 ArrayList]: Location invariant before [L119-L1053] (((main__y == 50) && (17 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,420 INFO L1541 ArrayList]: Location invariant before [L107-L1077] (((15 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,420 INFO L1541 ArrayList]: Location invariant before [L35-L1221] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (3 == main__x)) [2024-09-13 10:12:56,420 INFO L1541 ArrayList]: Location invariant before [L215-L861] (((33 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,420 INFO L1541 ArrayList]: Location invariant before [L287-L717] (((main__y == 50) && (45 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,420 INFO L1541 ArrayList]: Location invariant before [L221-L849] (((main__y == 50) && (34 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,420 INFO L1541 ArrayList]: Location invariant before [L239-L813] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (37 == main__x)) [2024-09-13 10:12:56,420 INFO L1541 ArrayList]: Location invariant before [L41-L1209] (((4 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,420 INFO L1541 ArrayList]: Location invariant before [L347-L597] (((55 == main__x) && (\old(__return_1121) == __return_1121)) && (55 == main__y)) [2024-09-13 10:12:56,420 INFO L1541 ArrayList]: Location invariant before [L245-L801] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (38 == main__x)) [2024-09-13 10:12:56,420 INFO L1541 ArrayList]: Location invariant before [L335-L621] (((53 == main__y) && (53 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,420 INFO L1541 ArrayList]: Location invariant before [L209-L873] (((32 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,420 INFO L1541 ArrayList]: Location invariant before [L71-L1149] (((9 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 10:12:56,421 INFO L1541 ArrayList]: Location invariant before [L47-L1197] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (5 == main__x)) [2024-09-13 10:12:56,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 10:12:56,625 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+nlh-reducer.c[6448,6461] [2024-09-13 10:12:56,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:12:56,679 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 10:12:56,723 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] 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 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 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 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 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 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 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 Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-13 10:12:56,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:12:56,842 INFO L204 MainTranslator]: Completed translation [2024-09-13 10:12:56,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:56 WrapperNode [2024-09-13 10:12:56,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 10:12:56,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 10:12:56,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 10:12:56,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 10:12:56,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:56" (1/1) ... [2024-09-13 10:12:56,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:56" (1/1) ... [2024-09-13 10:12:56,901 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 771 [2024-09-13 10:12:56,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 10:12:56,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 10:12:56,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 10:12:56,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 10:12:56,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:56" (1/1) ... [2024-09-13 10:12:56,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:56" (1/1) ... [2024-09-13 10:12:56,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:56" (1/1) ... [2024-09-13 10:12:56,942 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-13 10:12:56,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:56" (1/1) ... [2024-09-13 10:12:56,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:56" (1/1) ... [2024-09-13 10:12:56,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:56" (1/1) ... [2024-09-13 10:12:56,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:56" (1/1) ... [2024-09-13 10:12:56,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:56" (1/1) ... [2024-09-13 10:12:56,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:56" (1/1) ... [2024-09-13 10:12:56,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 10:12:56,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 10:12:56,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 10:12:56,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 10:12:56,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:56" (1/1) ... [2024-09-13 10:12:56,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:12:56,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:12:57,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 10:12:57,008 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 10:12:57,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 10:12:57,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 10:12:57,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 10:12:57,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 10:12:57,099 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 10:12:57,101 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 10:12:57,690 INFO L? ?]: Removed 275 outVars from TransFormulas that were not future-live. [2024-09-13 10:12:57,690 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 10:12:57,840 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 10:12:57,840 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-13 10:12:57,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:12:57 BoogieIcfgContainer [2024-09-13 10:12:57,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 10:12:57,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 10:12:57,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 10:12:57,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 10:12:57,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:12:55" (1/4) ... [2024-09-13 10:12:57,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192bfd5c and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:12:57, skipping insertion in model container [2024-09-13 10:12:57,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 10:12:56" (2/4) ... [2024-09-13 10:12:57,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192bfd5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:12:57, skipping insertion in model container [2024-09-13 10:12:57,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:56" (3/4) ... [2024-09-13 10:12:57,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192bfd5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:12:57, skipping insertion in model container [2024-09-13 10:12:57,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:12:57" (4/4) ... [2024-09-13 10:12:57,849 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2024-09-13 10:12:57,862 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 10:12:57,862 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 68 error locations. [2024-09-13 10:12:57,902 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 10:12:57,910 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;@61c7f72a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 10:12:57,911 INFO L337 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2024-09-13 10:12:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 276 states, 207 states have (on average 1.9903381642512077) internal successors, (412), 275 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:12:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-09-13 10:12:57,922 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:57,922 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-09-13 10:12:57,923 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:12:57,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:57,927 INFO L85 PathProgramCache]: Analyzing trace with hash 29588506, now seen corresponding path program 1 times [2024-09-13 10:12:57,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:57,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008082498] [2024-09-13 10:12:57,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:57,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:12:58,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:58,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008082498] [2024-09-13 10:12:58,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008082498] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:58,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:58,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:12:58,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338338141] [2024-09-13 10:12:58,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:58,148 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:58,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:58,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:58,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:58,173 INFO L87 Difference]: Start difference. First operand has 276 states, 207 states have (on average 1.9903381642512077) internal successors, (412), 275 states have internal predecessors, (412), 0 states have call successors, (0), 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 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 10:12:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:58,821 INFO L93 Difference]: Finished difference Result 275 states and 406 transitions. [2024-09-13 10:12:58,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:58,823 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 10:12:58,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:58,830 INFO L225 Difference]: With dead ends: 275 [2024-09-13 10:12:58,830 INFO L226 Difference]: Without dead ends: 273 [2024-09-13 10:12:58,831 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:58,833 INFO L434 NwaCegarLoop]: 267 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:58,834 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-13 10:12:58,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-09-13 10:12:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-09-13 10:12:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 206 states have (on average 1.645631067961165) internal successors, (339), 272 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:12:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 339 transitions. [2024-09-13 10:12:58,872 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 339 transitions. Word has length 4 [2024-09-13 10:12:58,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:58,872 INFO L474 AbstractCegarLoop]: Abstraction has 273 states and 339 transitions. [2024-09-13 10:12:58,872 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 10:12:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 339 transitions. [2024-09-13 10:12:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-13 10:12:58,890 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:58,890 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:58,890 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 10:12:58,890 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:12:58,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:58,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1002932306, now seen corresponding path program 1 times [2024-09-13 10:12:58,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:58,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615402906] [2024-09-13 10:12:58,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:58,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:12:59,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:59,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615402906] [2024-09-13 10:12:59,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615402906] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:59,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:59,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:12:59,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223015444] [2024-09-13 10:12:59,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:59,004 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:12:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:59,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:12:59,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:12:59,005 INFO L87 Difference]: Start difference. First operand 273 states and 339 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 10:12:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:59,570 INFO L93 Difference]: Finished difference Result 320 states and 432 transitions. [2024-09-13 10:12:59,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:12:59,571 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 10:12:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:59,572 INFO L225 Difference]: With dead ends: 320 [2024-09-13 10:12:59,572 INFO L226 Difference]: Without dead ends: 320 [2024-09-13 10:12:59,573 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:12:59,573 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 124 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:59,574 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 192 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-13 10:12:59,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-09-13 10:12:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 273. [2024-09-13 10:12:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 207 states have (on average 1.6328502415458936) internal successors, (338), 272 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:12:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 338 transitions. [2024-09-13 10:12:59,583 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 338 transitions. Word has length 7 [2024-09-13 10:12:59,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:59,584 INFO L474 AbstractCegarLoop]: Abstraction has 273 states and 338 transitions. [2024-09-13 10:12:59,584 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 10:12:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 338 transitions. [2024-09-13 10:12:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-13 10:12:59,584 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:59,584 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:59,584 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 10:12:59,584 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:12:59,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:59,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1731094578, now seen corresponding path program 1 times [2024-09-13 10:12:59,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:59,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066743651] [2024-09-13 10:12:59,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:59,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:12:59,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:59,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066743651] [2024-09-13 10:12:59,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066743651] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:59,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:59,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:12:59,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382363711] [2024-09-13 10:12:59,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:59,667 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:12:59,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:59,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:12:59,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:12:59,668 INFO L87 Difference]: Start difference. First operand 273 states and 338 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 10:13:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:00,206 INFO L93 Difference]: Finished difference Result 318 states and 428 transitions. [2024-09-13 10:13:00,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:00,207 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 10:13:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:00,208 INFO L225 Difference]: With dead ends: 318 [2024-09-13 10:13:00,208 INFO L226 Difference]: Without dead ends: 318 [2024-09-13 10:13:00,208 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:00,209 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 122 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:00,209 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 192 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-13 10:13:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-09-13 10:13:00,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 272. [2024-09-13 10:13:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 207 states have (on average 1.6231884057971016) internal successors, (336), 271 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 336 transitions. [2024-09-13 10:13:00,221 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 336 transitions. Word has length 10 [2024-09-13 10:13:00,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:00,221 INFO L474 AbstractCegarLoop]: Abstraction has 272 states and 336 transitions. [2024-09-13 10:13:00,221 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 10:13:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 336 transitions. [2024-09-13 10:13:00,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-13 10:13:00,222 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:00,222 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:00,222 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 10:13:00,222 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:00,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:00,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1366184436, now seen corresponding path program 1 times [2024-09-13 10:13:00,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:00,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659443916] [2024-09-13 10:13:00,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:00,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:00,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:00,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659443916] [2024-09-13 10:13:00,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659443916] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:00,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:00,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:00,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50484215] [2024-09-13 10:13:00,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:00,300 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:00,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:00,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:00,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:00,303 INFO L87 Difference]: Start difference. First operand 272 states and 336 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 10:13:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:00,693 INFO L93 Difference]: Finished difference Result 316 states and 424 transitions. [2024-09-13 10:13:00,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:00,693 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 10:13:00,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:00,694 INFO L225 Difference]: With dead ends: 316 [2024-09-13 10:13:00,695 INFO L226 Difference]: Without dead ends: 316 [2024-09-13 10:13:00,695 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:00,696 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 121 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:00,697 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 188 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-13 10:13:00,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-09-13 10:13:00,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 271. [2024-09-13 10:13:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 207 states have (on average 1.6135265700483092) internal successors, (334), 270 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2024-09-13 10:13:00,711 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 13 [2024-09-13 10:13:00,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:00,711 INFO L474 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2024-09-13 10:13:00,711 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 10:13:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2024-09-13 10:13:00,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 10:13:00,711 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:00,711 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:00,712 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 10:13:00,712 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:00,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:00,712 INFO L85 PathProgramCache]: Analyzing trace with hash -890360382, now seen corresponding path program 1 times [2024-09-13 10:13:00,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:00,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14547066] [2024-09-13 10:13:00,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:00,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:00,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:00,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14547066] [2024-09-13 10:13:00,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14547066] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:00,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:00,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:00,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27991407] [2024-09-13 10:13:00,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:00,800 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:00,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:00,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:00,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:00,801 INFO L87 Difference]: Start difference. First operand 271 states and 334 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 10:13:01,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:01,144 INFO L93 Difference]: Finished difference Result 314 states and 420 transitions. [2024-09-13 10:13:01,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:01,144 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 10:13:01,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:01,146 INFO L225 Difference]: With dead ends: 314 [2024-09-13 10:13:01,146 INFO L226 Difference]: Without dead ends: 314 [2024-09-13 10:13:01,146 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:01,146 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 119 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:01,147 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-09-13 10:13:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 270. [2024-09-13 10:13:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 207 states have (on average 1.603864734299517) internal successors, (332), 269 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 332 transitions. [2024-09-13 10:13:01,151 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 332 transitions. Word has length 16 [2024-09-13 10:13:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:01,151 INFO L474 AbstractCegarLoop]: Abstraction has 270 states and 332 transitions. [2024-09-13 10:13:01,151 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 10:13:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 332 transitions. [2024-09-13 10:13:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 10:13:01,152 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:01,152 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:01,152 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 10:13:01,152 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:01,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:01,153 INFO L85 PathProgramCache]: Analyzing trace with hash 991965440, now seen corresponding path program 1 times [2024-09-13 10:13:01,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:01,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876969237] [2024-09-13 10:13:01,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:01,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:01,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:01,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876969237] [2024-09-13 10:13:01,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876969237] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:01,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:01,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:01,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220408398] [2024-09-13 10:13:01,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:01,220 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:01,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:01,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:01,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:01,221 INFO L87 Difference]: Start difference. First operand 270 states and 332 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 10:13:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:01,708 INFO L93 Difference]: Finished difference Result 312 states and 416 transitions. [2024-09-13 10:13:01,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:01,708 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 10:13:01,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:01,709 INFO L225 Difference]: With dead ends: 312 [2024-09-13 10:13:01,709 INFO L226 Difference]: Without dead ends: 312 [2024-09-13 10:13:01,709 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:01,710 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 114 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:01,710 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 192 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-13 10:13:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-09-13 10:13:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 269. [2024-09-13 10:13:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 207 states have (on average 1.5942028985507246) internal successors, (330), 268 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 330 transitions. [2024-09-13 10:13:01,714 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 330 transitions. Word has length 19 [2024-09-13 10:13:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:01,714 INFO L474 AbstractCegarLoop]: Abstraction has 269 states and 330 transitions. [2024-09-13 10:13:01,714 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 10:13:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 330 transitions. [2024-09-13 10:13:01,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-13 10:13:01,714 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:01,714 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 10:13:01,714 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 10:13:01,715 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:01,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:01,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2027445322, now seen corresponding path program 1 times [2024-09-13 10:13:01,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:01,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187674896] [2024-09-13 10:13:01,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:01,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:01,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:01,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187674896] [2024-09-13 10:13:01,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187674896] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:01,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:01,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:01,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547698876] [2024-09-13 10:13:01,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:01,792 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:01,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:01,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:01,793 INFO L87 Difference]: Start difference. First operand 269 states and 330 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 10:13:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:02,217 INFO L93 Difference]: Finished difference Result 310 states and 412 transitions. [2024-09-13 10:13:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:02,217 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 10:13:02,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:02,218 INFO L225 Difference]: With dead ends: 310 [2024-09-13 10:13:02,218 INFO L226 Difference]: Without dead ends: 310 [2024-09-13 10:13:02,218 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:02,219 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 112 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:02,219 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 192 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-13 10:13:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-09-13 10:13:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 268. [2024-09-13 10:13:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 207 states have (on average 1.5845410628019323) internal successors, (328), 267 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 328 transitions. [2024-09-13 10:13:02,222 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 328 transitions. Word has length 22 [2024-09-13 10:13:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:02,223 INFO L474 AbstractCegarLoop]: Abstraction has 268 states and 328 transitions. [2024-09-13 10:13:02,223 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 10:13:02,223 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 328 transitions. [2024-09-13 10:13:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-13 10:13:02,223 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:02,223 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 10:13:02,223 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 10:13:02,223 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:02,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:02,224 INFO L85 PathProgramCache]: Analyzing trace with hash 501601268, now seen corresponding path program 1 times [2024-09-13 10:13:02,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:02,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666747131] [2024-09-13 10:13:02,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:02,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:02,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:02,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666747131] [2024-09-13 10:13:02,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666747131] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:02,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:02,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:02,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656227141] [2024-09-13 10:13:02,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:02,298 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:02,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:02,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:02,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:02,299 INFO L87 Difference]: Start difference. First operand 268 states and 328 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 10:13:02,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:02,727 INFO L93 Difference]: Finished difference Result 308 states and 408 transitions. [2024-09-13 10:13:02,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:02,727 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 10:13:02,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:02,728 INFO L225 Difference]: With dead ends: 308 [2024-09-13 10:13:02,728 INFO L226 Difference]: Without dead ends: 308 [2024-09-13 10:13:02,728 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:02,729 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 109 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:02,729 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 192 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-13 10:13:02,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-09-13 10:13:02,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 267. [2024-09-13 10:13:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 207 states have (on average 1.5748792270531402) internal successors, (326), 266 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:02,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 326 transitions. [2024-09-13 10:13:02,735 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 326 transitions. Word has length 25 [2024-09-13 10:13:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:02,735 INFO L474 AbstractCegarLoop]: Abstraction has 267 states and 326 transitions. [2024-09-13 10:13:02,735 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 10:13:02,735 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 326 transitions. [2024-09-13 10:13:02,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-13 10:13:02,736 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:02,736 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 10:13:02,736 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 10:13:02,736 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:02,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:02,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1012267434, now seen corresponding path program 1 times [2024-09-13 10:13:02,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:02,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383083309] [2024-09-13 10:13:02,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:02,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:02,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:02,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383083309] [2024-09-13 10:13:02,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383083309] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:02,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:02,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:02,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760629831] [2024-09-13 10:13:02,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:02,801 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:02,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:02,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:02,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:02,802 INFO L87 Difference]: Start difference. First operand 267 states and 326 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 10:13:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:03,126 INFO L93 Difference]: Finished difference Result 306 states and 404 transitions. [2024-09-13 10:13:03,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:03,127 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 10:13:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:03,128 INFO L225 Difference]: With dead ends: 306 [2024-09-13 10:13:03,128 INFO L226 Difference]: Without dead ends: 306 [2024-09-13 10:13:03,128 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:03,128 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 108 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:03,129 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 188 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-09-13 10:13:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 266. [2024-09-13 10:13:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 207 states have (on average 1.565217391304348) internal successors, (324), 265 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2024-09-13 10:13:03,132 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 28 [2024-09-13 10:13:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:03,132 INFO L474 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2024-09-13 10:13:03,132 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 10:13:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2024-09-13 10:13:03,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-13 10:13:03,133 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:03,133 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 10:13:03,133 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-13 10:13:03,133 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:03,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:03,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1493866216, now seen corresponding path program 1 times [2024-09-13 10:13:03,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:03,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824838190] [2024-09-13 10:13:03,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:03,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:03,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:03,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824838190] [2024-09-13 10:13:03,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824838190] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:03,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:03,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:03,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642387965] [2024-09-13 10:13:03,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:03,185 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:03,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:03,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:03,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:03,186 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 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 10:13:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:03,530 INFO L93 Difference]: Finished difference Result 304 states and 400 transitions. [2024-09-13 10:13:03,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:03,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 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 10:13:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:03,531 INFO L225 Difference]: With dead ends: 304 [2024-09-13 10:13:03,532 INFO L226 Difference]: Without dead ends: 304 [2024-09-13 10:13:03,532 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:03,532 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 106 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:03,532 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 190 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-09-13 10:13:03,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 265. [2024-09-13 10:13:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 207 states have (on average 1.5555555555555556) internal successors, (322), 264 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 322 transitions. [2024-09-13 10:13:03,536 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 322 transitions. Word has length 31 [2024-09-13 10:13:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:03,536 INFO L474 AbstractCegarLoop]: Abstraction has 265 states and 322 transitions. [2024-09-13 10:13:03,536 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 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 10:13:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 322 transitions. [2024-09-13 10:13:03,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-13 10:13:03,537 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:03,537 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:03,537 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-13 10:13:03,537 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:03,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash -682545250, now seen corresponding path program 1 times [2024-09-13 10:13:03,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:03,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313338698] [2024-09-13 10:13:03,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:03,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:03,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313338698] [2024-09-13 10:13:03,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313338698] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:03,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:03,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:03,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778347176] [2024-09-13 10:13:03,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:03,601 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:03,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:03,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:03,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:03,602 INFO L87 Difference]: Start difference. First operand 265 states and 322 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:03,915 INFO L93 Difference]: Finished difference Result 302 states and 396 transitions. [2024-09-13 10:13:03,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:03,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 10:13:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:03,917 INFO L225 Difference]: With dead ends: 302 [2024-09-13 10:13:03,917 INFO L226 Difference]: Without dead ends: 302 [2024-09-13 10:13:03,917 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:03,917 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 104 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:03,917 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 188 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-09-13 10:13:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 264. [2024-09-13 10:13:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 207 states have (on average 1.5458937198067633) internal successors, (320), 263 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 320 transitions. [2024-09-13 10:13:03,920 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 320 transitions. Word has length 34 [2024-09-13 10:13:03,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:03,921 INFO L474 AbstractCegarLoop]: Abstraction has 264 states and 320 transitions. [2024-09-13 10:13:03,921 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 320 transitions. [2024-09-13 10:13:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 10:13:03,921 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:03,921 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:03,921 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-13 10:13:03,921 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:03,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:03,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1330218530, now seen corresponding path program 1 times [2024-09-13 10:13:03,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:03,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781863996] [2024-09-13 10:13:03,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:03,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:03,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:03,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781863996] [2024-09-13 10:13:03,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781863996] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:03,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:03,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:03,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628379387] [2024-09-13 10:13:03,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:03,984 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:03,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:03,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:03,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:03,984 INFO L87 Difference]: Start difference. First operand 264 states and 320 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 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 10:13:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:04,368 INFO L93 Difference]: Finished difference Result 300 states and 392 transitions. [2024-09-13 10:13:04,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:04,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-09-13 10:13:04,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:04,369 INFO L225 Difference]: With dead ends: 300 [2024-09-13 10:13:04,369 INFO L226 Difference]: Without dead ends: 300 [2024-09-13 10:13:04,369 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:04,370 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 99 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:04,370 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 192 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-13 10:13:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-09-13 10:13:04,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 263. [2024-09-13 10:13:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 207 states have (on average 1.536231884057971) internal successors, (318), 262 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 318 transitions. [2024-09-13 10:13:04,373 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 318 transitions. Word has length 37 [2024-09-13 10:13:04,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:04,373 INFO L474 AbstractCegarLoop]: Abstraction has 263 states and 318 transitions. [2024-09-13 10:13:04,373 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 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 10:13:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 318 transitions. [2024-09-13 10:13:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-13 10:13:04,374 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:04,374 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:04,374 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-13 10:13:04,374 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:04,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:04,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1123167824, now seen corresponding path program 1 times [2024-09-13 10:13:04,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:04,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885877232] [2024-09-13 10:13:04,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:04,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:04,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:04,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885877232] [2024-09-13 10:13:04,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885877232] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:04,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:04,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:04,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455527621] [2024-09-13 10:13:04,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:04,444 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:04,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:04,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:04,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:04,445 INFO L87 Difference]: Start difference. First operand 263 states and 318 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:04,845 INFO L93 Difference]: Finished difference Result 298 states and 388 transitions. [2024-09-13 10:13:04,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:04,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-09-13 10:13:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:04,847 INFO L225 Difference]: With dead ends: 298 [2024-09-13 10:13:04,847 INFO L226 Difference]: Without dead ends: 298 [2024-09-13 10:13:04,847 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:04,848 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 97 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:04,848 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 192 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-13 10:13:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-09-13 10:13:04,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 262. [2024-09-13 10:13:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 207 states have (on average 1.5265700483091786) internal successors, (316), 261 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 316 transitions. [2024-09-13 10:13:04,854 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 316 transitions. Word has length 40 [2024-09-13 10:13:04,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:04,854 INFO L474 AbstractCegarLoop]: Abstraction has 262 states and 316 transitions. [2024-09-13 10:13:04,854 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 316 transitions. [2024-09-13 10:13:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-13 10:13:04,855 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:04,855 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:04,855 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-13 10:13:04,855 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:04,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:04,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1797393582, now seen corresponding path program 1 times [2024-09-13 10:13:04,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:04,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035341265] [2024-09-13 10:13:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:04,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:04,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:04,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035341265] [2024-09-13 10:13:04,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035341265] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:04,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:04,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:04,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080159510] [2024-09-13 10:13:04,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:04,948 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:04,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:04,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:04,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:04,948 INFO L87 Difference]: Start difference. First operand 262 states and 316 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 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 10:13:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:05,245 INFO L93 Difference]: Finished difference Result 296 states and 384 transitions. [2024-09-13 10:13:05,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:05,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-09-13 10:13:05,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:05,246 INFO L225 Difference]: With dead ends: 296 [2024-09-13 10:13:05,246 INFO L226 Difference]: Without dead ends: 296 [2024-09-13 10:13:05,247 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:05,247 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 96 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:05,247 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 188 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:05,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-09-13 10:13:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 261. [2024-09-13 10:13:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 207 states have (on average 1.5169082125603865) internal successors, (314), 260 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 314 transitions. [2024-09-13 10:13:05,251 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 314 transitions. Word has length 43 [2024-09-13 10:13:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:05,251 INFO L474 AbstractCegarLoop]: Abstraction has 261 states and 314 transitions. [2024-09-13 10:13:05,251 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 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 10:13:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 314 transitions. [2024-09-13 10:13:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-13 10:13:05,253 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:05,253 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:05,253 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-13 10:13:05,253 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:05,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:05,254 INFO L85 PathProgramCache]: Analyzing trace with hash -794747318, now seen corresponding path program 1 times [2024-09-13 10:13:05,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:05,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082334412] [2024-09-13 10:13:05,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:05,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:05,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:05,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082334412] [2024-09-13 10:13:05,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082334412] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:05,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:05,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:05,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194514126] [2024-09-13 10:13:05,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:05,331 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:05,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:05,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:05,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:05,332 INFO L87 Difference]: Start difference. First operand 261 states and 314 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:05,682 INFO L93 Difference]: Finished difference Result 294 states and 380 transitions. [2024-09-13 10:13:05,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:05,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-09-13 10:13:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:05,683 INFO L225 Difference]: With dead ends: 294 [2024-09-13 10:13:05,683 INFO L226 Difference]: Without dead ends: 294 [2024-09-13 10:13:05,683 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:05,683 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 92 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:05,683 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 192 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-09-13 10:13:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 260. [2024-09-13 10:13:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 207 states have (on average 1.5072463768115942) internal successors, (312), 259 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 312 transitions. [2024-09-13 10:13:05,687 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 312 transitions. Word has length 46 [2024-09-13 10:13:05,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:05,687 INFO L474 AbstractCegarLoop]: Abstraction has 260 states and 312 transitions. [2024-09-13 10:13:05,687 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:05,688 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 312 transitions. [2024-09-13 10:13:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-13 10:13:05,688 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:05,688 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:05,688 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-13 10:13:05,688 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:05,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:05,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1837537030, now seen corresponding path program 1 times [2024-09-13 10:13:05,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:05,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509980767] [2024-09-13 10:13:05,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:05,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:05,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:05,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509980767] [2024-09-13 10:13:05,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509980767] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:05,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:05,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:05,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66501588] [2024-09-13 10:13:05,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:05,748 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:05,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:05,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:05,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:05,748 INFO L87 Difference]: Start difference. First operand 260 states and 312 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 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 10:13:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:06,173 INFO L93 Difference]: Finished difference Result 292 states and 376 transitions. [2024-09-13 10:13:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:06,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 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) Word has length 49 [2024-09-13 10:13:06,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:06,174 INFO L225 Difference]: With dead ends: 292 [2024-09-13 10:13:06,174 INFO L226 Difference]: Without dead ends: 292 [2024-09-13 10:13:06,175 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:06,175 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 89 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:06,175 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 192 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-13 10:13:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-09-13 10:13:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 259. [2024-09-13 10:13:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 207 states have (on average 1.497584541062802) internal successors, (310), 258 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 310 transitions. [2024-09-13 10:13:06,178 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 310 transitions. Word has length 49 [2024-09-13 10:13:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:06,178 INFO L474 AbstractCegarLoop]: Abstraction has 259 states and 310 transitions. [2024-09-13 10:13:06,178 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 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 10:13:06,178 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 310 transitions. [2024-09-13 10:13:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-13 10:13:06,179 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:06,179 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:06,179 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-13 10:13:06,179 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:06,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1587299458, now seen corresponding path program 1 times [2024-09-13 10:13:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:06,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288157161] [2024-09-13 10:13:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:06,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:06,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:06,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288157161] [2024-09-13 10:13:06,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288157161] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:06,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:06,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:06,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602617875] [2024-09-13 10:13:06,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:06,239 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:06,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:06,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:06,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:06,239 INFO L87 Difference]: Start difference. First operand 259 states and 310 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:06,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:06,595 INFO L93 Difference]: Finished difference Result 290 states and 372 transitions. [2024-09-13 10:13:06,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:06,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-09-13 10:13:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:06,596 INFO L225 Difference]: With dead ends: 290 [2024-09-13 10:13:06,596 INFO L226 Difference]: Without dead ends: 290 [2024-09-13 10:13:06,596 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:06,597 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 86 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:06,597 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 190 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:06,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-09-13 10:13:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 258. [2024-09-13 10:13:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 207 states have (on average 1.4879227053140096) internal successors, (308), 257 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 308 transitions. [2024-09-13 10:13:06,599 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 308 transitions. Word has length 52 [2024-09-13 10:13:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:06,600 INFO L474 AbstractCegarLoop]: Abstraction has 258 states and 308 transitions. [2024-09-13 10:13:06,600 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 308 transitions. [2024-09-13 10:13:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-13 10:13:06,600 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:06,600 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:06,600 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-13 10:13:06,600 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:06,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:06,600 INFO L85 PathProgramCache]: Analyzing trace with hash 351980218, now seen corresponding path program 1 times [2024-09-13 10:13:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:06,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929580034] [2024-09-13 10:13:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:06,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:06,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929580034] [2024-09-13 10:13:06,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929580034] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:06,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:06,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:06,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591728698] [2024-09-13 10:13:06,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:06,667 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:06,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:06,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:06,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:06,667 INFO L87 Difference]: Start difference. First operand 258 states and 308 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:07,003 INFO L93 Difference]: Finished difference Result 288 states and 368 transitions. [2024-09-13 10:13:07,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:07,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-09-13 10:13:07,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:07,005 INFO L225 Difference]: With dead ends: 288 [2024-09-13 10:13:07,005 INFO L226 Difference]: Without dead ends: 288 [2024-09-13 10:13:07,005 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:07,005 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 86 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:07,005 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 190 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:07,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-09-13 10:13:07,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 257. [2024-09-13 10:13:07,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 207 states have (on average 1.4782608695652173) internal successors, (306), 256 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2024-09-13 10:13:07,008 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 55 [2024-09-13 10:13:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:07,008 INFO L474 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2024-09-13 10:13:07,008 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:07,008 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2024-09-13 10:13:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-13 10:13:07,008 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:07,009 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:07,009 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-13 10:13:07,009 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:07,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1827719346, now seen corresponding path program 1 times [2024-09-13 10:13:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:07,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837418705] [2024-09-13 10:13:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:07,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:07,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:07,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837418705] [2024-09-13 10:13:07,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837418705] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:07,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:07,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136572347] [2024-09-13 10:13:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:07,070 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:07,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:07,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:07,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:07,070 INFO L87 Difference]: Start difference. First operand 257 states and 306 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:07,340 INFO L93 Difference]: Finished difference Result 286 states and 364 transitions. [2024-09-13 10:13:07,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:07,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-09-13 10:13:07,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:07,341 INFO L225 Difference]: With dead ends: 286 [2024-09-13 10:13:07,341 INFO L226 Difference]: Without dead ends: 286 [2024-09-13 10:13:07,342 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:07,342 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 84 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:07,342 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 188 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:07,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-09-13 10:13:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 256. [2024-09-13 10:13:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 207 states have (on average 1.4685990338164252) internal successors, (304), 255 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 304 transitions. [2024-09-13 10:13:07,345 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 304 transitions. Word has length 58 [2024-09-13 10:13:07,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:07,345 INFO L474 AbstractCegarLoop]: Abstraction has 256 states and 304 transitions. [2024-09-13 10:13:07,345 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 304 transitions. [2024-09-13 10:13:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-13 10:13:07,345 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:07,345 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:07,345 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-13 10:13:07,346 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:07,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:07,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2008117650, now seen corresponding path program 1 times [2024-09-13 10:13:07,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:07,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018868578] [2024-09-13 10:13:07,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:07,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:07,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:07,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018868578] [2024-09-13 10:13:07,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018868578] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:07,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:07,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:07,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019358753] [2024-09-13 10:13:07,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:07,404 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:07,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:07,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:07,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:07,404 INFO L87 Difference]: Start difference. First operand 256 states and 304 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:07,739 INFO L93 Difference]: Finished difference Result 284 states and 360 transitions. [2024-09-13 10:13:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:07,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-09-13 10:13:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:07,740 INFO L225 Difference]: With dead ends: 284 [2024-09-13 10:13:07,740 INFO L226 Difference]: Without dead ends: 284 [2024-09-13 10:13:07,740 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:07,740 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 79 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:07,740 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 190 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:07,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-09-13 10:13:07,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 255. [2024-09-13 10:13:07,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 207 states have (on average 1.458937198067633) internal successors, (302), 254 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 302 transitions. [2024-09-13 10:13:07,743 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 302 transitions. Word has length 61 [2024-09-13 10:13:07,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:07,743 INFO L474 AbstractCegarLoop]: Abstraction has 255 states and 302 transitions. [2024-09-13 10:13:07,743 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 302 transitions. [2024-09-13 10:13:07,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-09-13 10:13:07,744 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:07,744 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:07,744 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-13 10:13:07,744 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:07,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:07,744 INFO L85 PathProgramCache]: Analyzing trace with hash 766789094, now seen corresponding path program 1 times [2024-09-13 10:13:07,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:07,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958084558] [2024-09-13 10:13:07,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:07,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:07,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:07,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958084558] [2024-09-13 10:13:07,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958084558] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:07,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:07,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:07,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667933222] [2024-09-13 10:13:07,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:07,810 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:07,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:07,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:07,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:07,810 INFO L87 Difference]: Start difference. First operand 255 states and 302 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 4 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 10:13:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:08,079 INFO L93 Difference]: Finished difference Result 282 states and 356 transitions. [2024-09-13 10:13:08,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:08,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 4 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) Word has length 64 [2024-09-13 10:13:08,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:08,080 INFO L225 Difference]: With dead ends: 282 [2024-09-13 10:13:08,080 INFO L226 Difference]: Without dead ends: 282 [2024-09-13 10:13:08,080 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:08,081 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 79 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:08,081 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 188 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-09-13 10:13:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 254. [2024-09-13 10:13:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 207 states have (on average 1.4492753623188406) internal successors, (300), 253 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 300 transitions. [2024-09-13 10:13:08,084 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 300 transitions. Word has length 64 [2024-09-13 10:13:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:08,084 INFO L474 AbstractCegarLoop]: Abstraction has 254 states and 300 transitions. [2024-09-13 10:13:08,084 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 4 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 10:13:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 300 transitions. [2024-09-13 10:13:08,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-13 10:13:08,084 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:08,084 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:08,084 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-13 10:13:08,084 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:08,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:08,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1516903902, now seen corresponding path program 1 times [2024-09-13 10:13:08,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:08,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606346044] [2024-09-13 10:13:08,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:08,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:08,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:08,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606346044] [2024-09-13 10:13:08,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606346044] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:08,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:08,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:08,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627937071] [2024-09-13 10:13:08,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:08,149 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:08,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:08,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:08,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:08,149 INFO L87 Difference]: Start difference. First operand 254 states and 300 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:08,495 INFO L93 Difference]: Finished difference Result 280 states and 352 transitions. [2024-09-13 10:13:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:08,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-09-13 10:13:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:08,497 INFO L225 Difference]: With dead ends: 280 [2024-09-13 10:13:08,497 INFO L226 Difference]: Without dead ends: 280 [2024-09-13 10:13:08,497 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:08,498 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 74 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:08,498 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 192 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:08,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-09-13 10:13:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 253. [2024-09-13 10:13:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 207 states have (on average 1.4396135265700483) internal successors, (298), 252 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 298 transitions. [2024-09-13 10:13:08,500 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 298 transitions. Word has length 67 [2024-09-13 10:13:08,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:08,501 INFO L474 AbstractCegarLoop]: Abstraction has 253 states and 298 transitions. [2024-09-13 10:13:08,501 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,501 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 298 transitions. [2024-09-13 10:13:08,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-13 10:13:08,501 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:08,501 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:08,501 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-13 10:13:08,501 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:08,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1561998108, now seen corresponding path program 1 times [2024-09-13 10:13:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:08,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469463140] [2024-09-13 10:13:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:08,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469463140] [2024-09-13 10:13:08,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469463140] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:08,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:08,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:08,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588468510] [2024-09-13 10:13:08,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:08,562 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:08,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:08,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:08,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:08,563 INFO L87 Difference]: Start difference. First operand 253 states and 298 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:08,902 INFO L93 Difference]: Finished difference Result 278 states and 348 transitions. [2024-09-13 10:13:08,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:08,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-09-13 10:13:08,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:08,903 INFO L225 Difference]: With dead ends: 278 [2024-09-13 10:13:08,903 INFO L226 Difference]: Without dead ends: 278 [2024-09-13 10:13:08,903 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:08,903 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 72 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:08,904 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 192 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:08,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-09-13 10:13:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 252. [2024-09-13 10:13:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 207 states have (on average 1.429951690821256) internal successors, (296), 251 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 296 transitions. [2024-09-13 10:13:08,906 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 296 transitions. Word has length 70 [2024-09-13 10:13:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:08,906 INFO L474 AbstractCegarLoop]: Abstraction has 252 states and 296 transitions. [2024-09-13 10:13:08,906 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 296 transitions. [2024-09-13 10:13:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-13 10:13:08,907 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:08,907 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:08,907 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-13 10:13:08,907 INFO L399 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:08,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:08,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1810214548, now seen corresponding path program 1 times [2024-09-13 10:13:08,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:08,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628723467] [2024-09-13 10:13:08,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:08,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:08,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:08,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628723467] [2024-09-13 10:13:08,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628723467] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:08,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:08,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:08,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670295096] [2024-09-13 10:13:08,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:08,980 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:08,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:08,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:08,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:08,981 INFO L87 Difference]: Start difference. First operand 252 states and 296 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:09,266 INFO L93 Difference]: Finished difference Result 276 states and 344 transitions. [2024-09-13 10:13:09,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:09,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-09-13 10:13:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:09,267 INFO L225 Difference]: With dead ends: 276 [2024-09-13 10:13:09,267 INFO L226 Difference]: Without dead ends: 276 [2024-09-13 10:13:09,267 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:09,268 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 71 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:09,268 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 188 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:09,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-09-13 10:13:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 251. [2024-09-13 10:13:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 207 states have (on average 1.4202898550724639) internal successors, (294), 250 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 294 transitions. [2024-09-13 10:13:09,270 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 294 transitions. Word has length 73 [2024-09-13 10:13:09,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:09,271 INFO L474 AbstractCegarLoop]: Abstraction has 251 states and 294 transitions. [2024-09-13 10:13:09,271 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 294 transitions. [2024-09-13 10:13:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-09-13 10:13:09,271 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:09,271 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:09,271 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-09-13 10:13:09,271 INFO L399 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:09,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:09,271 INFO L85 PathProgramCache]: Analyzing trace with hash 492504784, now seen corresponding path program 1 times [2024-09-13 10:13:09,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:09,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250627305] [2024-09-13 10:13:09,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:09,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:09,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:09,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250627305] [2024-09-13 10:13:09,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250627305] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:09,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:09,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:09,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816332687] [2024-09-13 10:13:09,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:09,343 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:09,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:09,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:09,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:09,343 INFO L87 Difference]: Start difference. First operand 251 states and 294 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:09,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:09,572 INFO L93 Difference]: Finished difference Result 274 states and 340 transitions. [2024-09-13 10:13:09,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:09,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-09-13 10:13:09,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:09,573 INFO L225 Difference]: With dead ends: 274 [2024-09-13 10:13:09,573 INFO L226 Difference]: Without dead ends: 274 [2024-09-13 10:13:09,573 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:09,573 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 68 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:09,573 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 188 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-09-13 10:13:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 250. [2024-09-13 10:13:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 249 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 292 transitions. [2024-09-13 10:13:09,578 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 292 transitions. Word has length 76 [2024-09-13 10:13:09,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:09,578 INFO L474 AbstractCegarLoop]: Abstraction has 250 states and 292 transitions. [2024-09-13 10:13:09,579 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:09,579 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 292 transitions. [2024-09-13 10:13:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-09-13 10:13:09,579 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:09,579 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:09,579 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-09-13 10:13:09,580 INFO L399 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:09,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash 602020942, now seen corresponding path program 1 times [2024-09-13 10:13:09,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:09,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183456855] [2024-09-13 10:13:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:09,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:09,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:09,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183456855] [2024-09-13 10:13:09,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183456855] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:09,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:09,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:09,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409961247] [2024-09-13 10:13:09,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:09,646 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:09,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:09,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:09,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:09,646 INFO L87 Difference]: Start difference. First operand 250 states and 292 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:09,928 INFO L93 Difference]: Finished difference Result 272 states and 336 transitions. [2024-09-13 10:13:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:09,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-09-13 10:13:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:09,929 INFO L225 Difference]: With dead ends: 272 [2024-09-13 10:13:09,929 INFO L226 Difference]: Without dead ends: 272 [2024-09-13 10:13:09,929 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:09,930 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 64 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:09,930 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 190 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:09,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-09-13 10:13:09,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 249. [2024-09-13 10:13:09,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 207 states have (on average 1.4009661835748792) internal successors, (290), 248 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 290 transitions. [2024-09-13 10:13:09,933 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 290 transitions. Word has length 79 [2024-09-13 10:13:09,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:09,934 INFO L474 AbstractCegarLoop]: Abstraction has 249 states and 290 transitions. [2024-09-13 10:13:09,934 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 290 transitions. [2024-09-13 10:13:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-13 10:13:09,934 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:09,934 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:09,934 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-09-13 10:13:09,934 INFO L399 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:09,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:09,935 INFO L85 PathProgramCache]: Analyzing trace with hash -977251132, now seen corresponding path program 1 times [2024-09-13 10:13:09,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:09,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629972803] [2024-09-13 10:13:09,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:09,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:10,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:10,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629972803] [2024-09-13 10:13:10,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629972803] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:10,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:10,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:10,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478830947] [2024-09-13 10:13:10,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:10,002 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:10,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:10,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:10,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:10,002 INFO L87 Difference]: Start difference. First operand 249 states and 290 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:10,247 INFO L93 Difference]: Finished difference Result 270 states and 332 transitions. [2024-09-13 10:13:10,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:10,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-09-13 10:13:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:10,248 INFO L225 Difference]: With dead ends: 270 [2024-09-13 10:13:10,248 INFO L226 Difference]: Without dead ends: 270 [2024-09-13 10:13:10,249 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:10,249 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 64 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:10,249 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 188 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-09-13 10:13:10,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 248. [2024-09-13 10:13:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 207 states have (on average 1.391304347826087) internal successors, (288), 247 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 288 transitions. [2024-09-13 10:13:10,252 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 288 transitions. Word has length 82 [2024-09-13 10:13:10,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:10,252 INFO L474 AbstractCegarLoop]: Abstraction has 248 states and 288 transitions. [2024-09-13 10:13:10,252 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 288 transitions. [2024-09-13 10:13:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-13 10:13:10,252 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:10,252 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:10,252 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-09-13 10:13:10,253 INFO L399 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:10,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:10,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1999837374, now seen corresponding path program 1 times [2024-09-13 10:13:10,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:10,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458025594] [2024-09-13 10:13:10,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:10,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:10,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458025594] [2024-09-13 10:13:10,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458025594] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:10,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:10,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:10,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102341368] [2024-09-13 10:13:10,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:10,323 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:10,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:10,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:10,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:10,324 INFO L87 Difference]: Start difference. First operand 248 states and 288 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:10,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:10,625 INFO L93 Difference]: Finished difference Result 268 states and 328 transitions. [2024-09-13 10:13:10,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:10,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-09-13 10:13:10,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:10,626 INFO L225 Difference]: With dead ends: 268 [2024-09-13 10:13:10,626 INFO L226 Difference]: Without dead ends: 268 [2024-09-13 10:13:10,627 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:10,627 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 61 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:10,627 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 190 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-09-13 10:13:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 247. [2024-09-13 10:13:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 207 states have (on average 1.3816425120772946) internal successors, (286), 246 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 286 transitions. [2024-09-13 10:13:10,629 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 286 transitions. Word has length 85 [2024-09-13 10:13:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:10,629 INFO L474 AbstractCegarLoop]: Abstraction has 247 states and 286 transitions. [2024-09-13 10:13:10,629 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 286 transitions. [2024-09-13 10:13:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-09-13 10:13:10,630 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:10,630 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:10,630 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-09-13 10:13:10,630 INFO L399 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:10,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:10,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1663532360, now seen corresponding path program 1 times [2024-09-13 10:13:10,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:10,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147973889] [2024-09-13 10:13:10,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:10,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:10,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:10,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147973889] [2024-09-13 10:13:10,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147973889] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:10,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:10,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:10,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576734252] [2024-09-13 10:13:10,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:10,705 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:10,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:10,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:10,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:10,706 INFO L87 Difference]: Start difference. First operand 247 states and 286 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:10,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:10,986 INFO L93 Difference]: Finished difference Result 266 states and 324 transitions. [2024-09-13 10:13:10,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:10,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-09-13 10:13:10,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:10,987 INFO L225 Difference]: With dead ends: 266 [2024-09-13 10:13:10,987 INFO L226 Difference]: Without dead ends: 266 [2024-09-13 10:13:10,988 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:10,988 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 59 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:10,989 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 188 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-09-13 10:13:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 246. [2024-09-13 10:13:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 207 states have (on average 1.3719806763285025) internal successors, (284), 245 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 284 transitions. [2024-09-13 10:13:10,991 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 284 transitions. Word has length 88 [2024-09-13 10:13:10,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:10,991 INFO L474 AbstractCegarLoop]: Abstraction has 246 states and 284 transitions. [2024-09-13 10:13:10,991 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:10,991 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 284 transitions. [2024-09-13 10:13:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-09-13 10:13:10,991 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:10,992 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:10,992 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-09-13 10:13:10,992 INFO L399 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:10,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1335415350, now seen corresponding path program 1 times [2024-09-13 10:13:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:10,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484003008] [2024-09-13 10:13:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:10,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:11,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:11,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484003008] [2024-09-13 10:13:11,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484003008] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:11,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:11,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:11,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824189449] [2024-09-13 10:13:11,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:11,068 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:11,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:11,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:11,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:11,068 INFO L87 Difference]: Start difference. First operand 246 states and 284 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:11,316 INFO L93 Difference]: Finished difference Result 264 states and 320 transitions. [2024-09-13 10:13:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:11,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-09-13 10:13:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:11,317 INFO L225 Difference]: With dead ends: 264 [2024-09-13 10:13:11,317 INFO L226 Difference]: Without dead ends: 264 [2024-09-13 10:13:11,317 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:11,317 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 56 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:11,317 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 188 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-09-13 10:13:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 245. [2024-09-13 10:13:11,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 207 states have (on average 1.3623188405797102) internal successors, (282), 244 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 282 transitions. [2024-09-13 10:13:11,320 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 282 transitions. Word has length 91 [2024-09-13 10:13:11,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:11,320 INFO L474 AbstractCegarLoop]: Abstraction has 245 states and 282 transitions. [2024-09-13 10:13:11,320 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 282 transitions. [2024-09-13 10:13:11,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-09-13 10:13:11,321 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:11,321 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:11,321 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-09-13 10:13:11,321 INFO L399 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:11,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:11,321 INFO L85 PathProgramCache]: Analyzing trace with hash -923037524, now seen corresponding path program 1 times [2024-09-13 10:13:11,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:11,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931076319] [2024-09-13 10:13:11,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:11,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:11,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:11,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931076319] [2024-09-13 10:13:11,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931076319] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:11,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:11,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:11,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893957701] [2024-09-13 10:13:11,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:11,394 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:11,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:11,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:11,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:11,395 INFO L87 Difference]: Start difference. First operand 245 states and 282 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:11,749 INFO L93 Difference]: Finished difference Result 262 states and 316 transitions. [2024-09-13 10:13:11,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:11,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-09-13 10:13:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:11,750 INFO L225 Difference]: With dead ends: 262 [2024-09-13 10:13:11,750 INFO L226 Difference]: Without dead ends: 262 [2024-09-13 10:13:11,751 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:11,751 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 52 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:11,751 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 192 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-09-13 10:13:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 244. [2024-09-13 10:13:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 207 states have (on average 1.3526570048309179) internal successors, (280), 243 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 280 transitions. [2024-09-13 10:13:11,754 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 280 transitions. Word has length 94 [2024-09-13 10:13:11,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:11,755 INFO L474 AbstractCegarLoop]: Abstraction has 244 states and 280 transitions. [2024-09-13 10:13:11,755 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:11,755 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 280 transitions. [2024-09-13 10:13:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-09-13 10:13:11,755 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:11,755 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:11,755 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-09-13 10:13:11,755 INFO L399 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:11,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:11,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1829905110, now seen corresponding path program 1 times [2024-09-13 10:13:11,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:11,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717609312] [2024-09-13 10:13:11,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:11,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:11,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:11,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717609312] [2024-09-13 10:13:11,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717609312] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:11,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:11,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:11,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504250101] [2024-09-13 10:13:11,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:11,832 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:11,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:11,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:11,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:11,833 INFO L87 Difference]: Start difference. First operand 244 states and 280 transitions. Second operand has 5 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:12,102 INFO L93 Difference]: Finished difference Result 260 states and 312 transitions. [2024-09-13 10:13:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:12,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-09-13 10:13:12,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:12,103 INFO L225 Difference]: With dead ends: 260 [2024-09-13 10:13:12,103 INFO L226 Difference]: Without dead ends: 260 [2024-09-13 10:13:12,103 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:12,104 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 51 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:12,104 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 188 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:12,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-09-13 10:13:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 243. [2024-09-13 10:13:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 207 states have (on average 1.3429951690821256) internal successors, (278), 242 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 278 transitions. [2024-09-13 10:13:12,108 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 278 transitions. Word has length 97 [2024-09-13 10:13:12,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:12,108 INFO L474 AbstractCegarLoop]: Abstraction has 243 states and 278 transitions. [2024-09-13 10:13:12,109 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 278 transitions. [2024-09-13 10:13:12,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-09-13 10:13:12,109 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:12,109 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:12,109 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-09-13 10:13:12,109 INFO L399 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:12,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:12,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1317109408, now seen corresponding path program 1 times [2024-09-13 10:13:12,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:12,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329646625] [2024-09-13 10:13:12,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:12,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:12,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:12,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329646625] [2024-09-13 10:13:12,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329646625] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:12,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:12,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:12,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364562517] [2024-09-13 10:13:12,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:12,187 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:12,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:12,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:12,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:12,187 INFO L87 Difference]: Start difference. First operand 243 states and 278 transitions. Second operand has 5 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:12,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:12,439 INFO L93 Difference]: Finished difference Result 258 states and 308 transitions. [2024-09-13 10:13:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:12,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-09-13 10:13:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:12,440 INFO L225 Difference]: With dead ends: 258 [2024-09-13 10:13:12,440 INFO L226 Difference]: Without dead ends: 258 [2024-09-13 10:13:12,441 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:12,441 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 46 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:12,441 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 190 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:12,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-09-13 10:13:12,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 242. [2024-09-13 10:13:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 207 states have (on average 1.3333333333333333) internal successors, (276), 241 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 276 transitions. [2024-09-13 10:13:12,443 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 276 transitions. Word has length 100 [2024-09-13 10:13:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:12,443 INFO L474 AbstractCegarLoop]: Abstraction has 242 states and 276 transitions. [2024-09-13 10:13:12,443 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 276 transitions. [2024-09-13 10:13:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-09-13 10:13:12,444 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:12,444 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:12,444 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-09-13 10:13:12,444 INFO L399 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:12,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:12,444 INFO L85 PathProgramCache]: Analyzing trace with hash -814479328, now seen corresponding path program 1 times [2024-09-13 10:13:12,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:12,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532983169] [2024-09-13 10:13:12,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:12,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:12,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:12,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532983169] [2024-09-13 10:13:12,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532983169] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:12,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:12,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:12,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186573411] [2024-09-13 10:13:12,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:12,526 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:12,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:12,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:12,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:12,527 INFO L87 Difference]: Start difference. First operand 242 states and 276 transitions. Second operand has 5 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:12,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:12,751 INFO L93 Difference]: Finished difference Result 256 states and 304 transitions. [2024-09-13 10:13:12,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:12,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-09-13 10:13:12,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:12,752 INFO L225 Difference]: With dead ends: 256 [2024-09-13 10:13:12,752 INFO L226 Difference]: Without dead ends: 256 [2024-09-13 10:13:12,753 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:12,753 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 46 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:12,753 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 188 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:12,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-09-13 10:13:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 241. [2024-09-13 10:13:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 207 states have (on average 1.3236714975845412) internal successors, (274), 240 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 274 transitions. [2024-09-13 10:13:12,755 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 274 transitions. Word has length 103 [2024-09-13 10:13:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:12,755 INFO L474 AbstractCegarLoop]: Abstraction has 241 states and 274 transitions. [2024-09-13 10:13:12,755 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 274 transitions. [2024-09-13 10:13:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-09-13 10:13:12,756 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:12,756 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:12,756 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-09-13 10:13:12,756 INFO L399 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:12,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1883032238, now seen corresponding path program 1 times [2024-09-13 10:13:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:12,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372855248] [2024-09-13 10:13:12,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:12,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:12,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:12,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372855248] [2024-09-13 10:13:12,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372855248] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:12,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:12,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:12,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476230893] [2024-09-13 10:13:12,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:12,830 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:12,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:12,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:12,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:12,831 INFO L87 Difference]: Start difference. First operand 241 states and 274 transitions. Second operand has 5 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:13,048 INFO L93 Difference]: Finished difference Result 254 states and 300 transitions. [2024-09-13 10:13:13,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:13,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2024-09-13 10:13:13,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:13,049 INFO L225 Difference]: With dead ends: 254 [2024-09-13 10:13:13,049 INFO L226 Difference]: Without dead ends: 254 [2024-09-13 10:13:13,049 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:13,050 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 44 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:13,050 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 188 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:13,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-09-13 10:13:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2024-09-13 10:13:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 207 states have (on average 1.3140096618357489) internal successors, (272), 239 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:13,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 272 transitions. [2024-09-13 10:13:13,052 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 272 transitions. Word has length 106 [2024-09-13 10:13:13,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:13,052 INFO L474 AbstractCegarLoop]: Abstraction has 240 states and 272 transitions. [2024-09-13 10:13:13,052 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 272 transitions. [2024-09-13 10:13:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-09-13 10:13:13,052 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:13,052 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:13,052 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-09-13 10:13:13,053 INFO L399 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:13,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:13,053 INFO L85 PathProgramCache]: Analyzing trace with hash -845166188, now seen corresponding path program 1 times [2024-09-13 10:13:13,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:13,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603870240] [2024-09-13 10:13:13,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:13,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:13,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:13,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603870240] [2024-09-13 10:13:13,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603870240] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:13,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:13,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:13,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732203294] [2024-09-13 10:13:13,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:13,125 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:13,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:13,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:13,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:13,126 INFO L87 Difference]: Start difference. First operand 240 states and 272 transitions. Second operand has 5 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:13,463 INFO L93 Difference]: Finished difference Result 252 states and 296 transitions. [2024-09-13 10:13:13,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:13,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-09-13 10:13:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:13,464 INFO L225 Difference]: With dead ends: 252 [2024-09-13 10:13:13,464 INFO L226 Difference]: Without dead ends: 252 [2024-09-13 10:13:13,465 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:13,465 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 39 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:13,465 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 192 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:13,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-09-13 10:13:13,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 239. [2024-09-13 10:13:13,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 207 states have (on average 1.3043478260869565) internal successors, (270), 238 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 270 transitions. [2024-09-13 10:13:13,468 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 270 transitions. Word has length 109 [2024-09-13 10:13:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:13,468 INFO L474 AbstractCegarLoop]: Abstraction has 239 states and 270 transitions. [2024-09-13 10:13:13,468 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 270 transitions. [2024-09-13 10:13:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-09-13 10:13:13,469 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:13,469 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:13,469 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-09-13 10:13:13,469 INFO L399 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:13,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1247224500, now seen corresponding path program 1 times [2024-09-13 10:13:13,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:13,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441586830] [2024-09-13 10:13:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:13,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:13,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:13,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441586830] [2024-09-13 10:13:13,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441586830] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:13,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:13,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:13,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348888105] [2024-09-13 10:13:13,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:13,547 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:13,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:13,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:13,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:13,548 INFO L87 Difference]: Start difference. First operand 239 states and 270 transitions. Second operand has 5 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:13,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:13,789 INFO L93 Difference]: Finished difference Result 250 states and 292 transitions. [2024-09-13 10:13:13,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:13,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-09-13 10:13:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:13,790 INFO L225 Difference]: With dead ends: 250 [2024-09-13 10:13:13,790 INFO L226 Difference]: Without dead ends: 250 [2024-09-13 10:13:13,790 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:13,790 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 37 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:13,790 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 190 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-09-13 10:13:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2024-09-13 10:13:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 207 states have (on average 1.2946859903381642) internal successors, (268), 237 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 268 transitions. [2024-09-13 10:13:13,792 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 268 transitions. Word has length 112 [2024-09-13 10:13:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:13,793 INFO L474 AbstractCegarLoop]: Abstraction has 238 states and 268 transitions. [2024-09-13 10:13:13,793 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 268 transitions. [2024-09-13 10:13:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-13 10:13:13,793 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:13,793 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:13,793 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-09-13 10:13:13,793 INFO L399 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:13,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:13,793 INFO L85 PathProgramCache]: Analyzing trace with hash -302598840, now seen corresponding path program 1 times [2024-09-13 10:13:13,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:13,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897779817] [2024-09-13 10:13:13,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:13,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:13,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:13,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897779817] [2024-09-13 10:13:13,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897779817] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:13,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:13,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:13,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180015200] [2024-09-13 10:13:13,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:13,861 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:13,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:13,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:13,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:13,861 INFO L87 Difference]: Start difference. First operand 238 states and 268 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:14,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:14,099 INFO L93 Difference]: Finished difference Result 248 states and 288 transitions. [2024-09-13 10:13:14,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:14,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-09-13 10:13:14,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:14,100 INFO L225 Difference]: With dead ends: 248 [2024-09-13 10:13:14,100 INFO L226 Difference]: Without dead ends: 248 [2024-09-13 10:13:14,100 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:14,101 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 36 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:14,101 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 190 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:14,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-09-13 10:13:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 237. [2024-09-13 10:13:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 207 states have (on average 1.285024154589372) internal successors, (266), 236 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 266 transitions. [2024-09-13 10:13:14,103 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 266 transitions. Word has length 115 [2024-09-13 10:13:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:14,103 INFO L474 AbstractCegarLoop]: Abstraction has 237 states and 266 transitions. [2024-09-13 10:13:14,103 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:14,103 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 266 transitions. [2024-09-13 10:13:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-09-13 10:13:14,104 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:14,104 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:14,104 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-09-13 10:13:14,104 INFO L399 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:14,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash 414724736, now seen corresponding path program 1 times [2024-09-13 10:13:14,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:14,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863616398] [2024-09-13 10:13:14,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:14,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:14,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:14,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863616398] [2024-09-13 10:13:14,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863616398] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:14,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:14,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:14,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135204895] [2024-09-13 10:13:14,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:14,176 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:14,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:14,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:14,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:14,176 INFO L87 Difference]: Start difference. First operand 237 states and 266 transitions. Second operand has 5 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:14,414 INFO L93 Difference]: Finished difference Result 246 states and 284 transitions. [2024-09-13 10:13:14,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:14,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-09-13 10:13:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:14,415 INFO L225 Difference]: With dead ends: 246 [2024-09-13 10:13:14,415 INFO L226 Difference]: Without dead ends: 246 [2024-09-13 10:13:14,415 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:14,415 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 32 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:14,415 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 190 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-09-13 10:13:14,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 236. [2024-09-13 10:13:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 207 states have (on average 1.2753623188405796) internal successors, (264), 235 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 264 transitions. [2024-09-13 10:13:14,417 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 264 transitions. Word has length 118 [2024-09-13 10:13:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:14,418 INFO L474 AbstractCegarLoop]: Abstraction has 236 states and 264 transitions. [2024-09-13 10:13:14,418 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 264 transitions. [2024-09-13 10:13:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-09-13 10:13:14,418 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:14,418 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:14,418 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-09-13 10:13:14,418 INFO L399 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:14,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1555877636, now seen corresponding path program 1 times [2024-09-13 10:13:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:14,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787126385] [2024-09-13 10:13:14,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:14,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:14,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:14,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787126385] [2024-09-13 10:13:14,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787126385] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:14,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:14,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:14,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231325459] [2024-09-13 10:13:14,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:14,499 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:14,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:14,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:14,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:14,500 INFO L87 Difference]: Start difference. First operand 236 states and 264 transitions. Second operand has 5 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:14,736 INFO L93 Difference]: Finished difference Result 244 states and 280 transitions. [2024-09-13 10:13:14,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:14,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-09-13 10:13:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:14,737 INFO L225 Difference]: With dead ends: 244 [2024-09-13 10:13:14,737 INFO L226 Difference]: Without dead ends: 244 [2024-09-13 10:13:14,737 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:14,737 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 29 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:14,737 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 190 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-09-13 10:13:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 235. [2024-09-13 10:13:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 207 states have (on average 1.2657004830917875) internal successors, (262), 234 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 262 transitions. [2024-09-13 10:13:14,739 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 262 transitions. Word has length 121 [2024-09-13 10:13:14,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:14,739 INFO L474 AbstractCegarLoop]: Abstraction has 235 states and 262 transitions. [2024-09-13 10:13:14,739 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:14,740 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 262 transitions. [2024-09-13 10:13:14,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-09-13 10:13:14,740 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:14,740 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:14,740 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-09-13 10:13:14,740 INFO L399 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:14,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:14,740 INFO L85 PathProgramCache]: Analyzing trace with hash 136837044, now seen corresponding path program 1 times [2024-09-13 10:13:14,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:14,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224524835] [2024-09-13 10:13:14,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:14,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:14,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:14,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224524835] [2024-09-13 10:13:14,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224524835] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:14,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:14,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751794898] [2024-09-13 10:13:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:14,825 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:14,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:14,826 INFO L87 Difference]: Start difference. First operand 235 states and 262 transitions. Second operand has 5 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:15,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:15,011 INFO L93 Difference]: Finished difference Result 242 states and 276 transitions. [2024-09-13 10:13:15,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:15,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-09-13 10:13:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:15,012 INFO L225 Difference]: With dead ends: 242 [2024-09-13 10:13:15,012 INFO L226 Difference]: Without dead ends: 242 [2024-09-13 10:13:15,012 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:15,012 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:15,013 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 188 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:15,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-09-13 10:13:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 234. [2024-09-13 10:13:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.2560386473429952) internal successors, (260), 233 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 260 transitions. [2024-09-13 10:13:15,015 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 260 transitions. Word has length 124 [2024-09-13 10:13:15,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:15,015 INFO L474 AbstractCegarLoop]: Abstraction has 234 states and 260 transitions. [2024-09-13 10:13:15,015 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 260 transitions. [2024-09-13 10:13:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-09-13 10:13:15,015 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:15,015 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:15,015 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-09-13 10:13:15,015 INFO L399 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:15,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:15,016 INFO L85 PathProgramCache]: Analyzing trace with hash 588856496, now seen corresponding path program 1 times [2024-09-13 10:13:15,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:15,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621460666] [2024-09-13 10:13:15,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:15,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:15,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:15,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621460666] [2024-09-13 10:13:15,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621460666] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:15,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:15,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:15,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580086063] [2024-09-13 10:13:15,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:15,093 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:15,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:15,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:15,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:15,094 INFO L87 Difference]: Start difference. First operand 234 states and 260 transitions. Second operand has 5 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:15,320 INFO L93 Difference]: Finished difference Result 240 states and 272 transitions. [2024-09-13 10:13:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:15,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-09-13 10:13:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:15,321 INFO L225 Difference]: With dead ends: 240 [2024-09-13 10:13:15,321 INFO L226 Difference]: Without dead ends: 240 [2024-09-13 10:13:15,321 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:15,321 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 26 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:15,321 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 190 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-09-13 10:13:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 233. [2024-09-13 10:13:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 207 states have (on average 1.2463768115942029) internal successors, (258), 232 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 258 transitions. [2024-09-13 10:13:15,323 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 258 transitions. Word has length 127 [2024-09-13 10:13:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:15,323 INFO L474 AbstractCegarLoop]: Abstraction has 233 states and 258 transitions. [2024-09-13 10:13:15,324 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 258 transitions. [2024-09-13 10:13:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-09-13 10:13:15,324 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:15,324 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:15,324 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-09-13 10:13:15,324 INFO L399 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:15,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:15,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1977887976, now seen corresponding path program 1 times [2024-09-13 10:13:15,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:15,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152031730] [2024-09-13 10:13:15,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:15,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:15,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:15,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152031730] [2024-09-13 10:13:15,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152031730] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:15,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:15,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:15,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223136844] [2024-09-13 10:13:15,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:15,402 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:15,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:15,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:15,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:15,402 INFO L87 Difference]: Start difference. First operand 233 states and 258 transitions. Second operand has 5 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:15,592 INFO L93 Difference]: Finished difference Result 238 states and 268 transitions. [2024-09-13 10:13:15,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:15,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-09-13 10:13:15,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:15,593 INFO L225 Difference]: With dead ends: 238 [2024-09-13 10:13:15,593 INFO L226 Difference]: Without dead ends: 238 [2024-09-13 10:13:15,593 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:15,594 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 24 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:15,594 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 188 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-09-13 10:13:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 232. [2024-09-13 10:13:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 231 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 256 transitions. [2024-09-13 10:13:15,596 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 256 transitions. Word has length 130 [2024-09-13 10:13:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:15,596 INFO L474 AbstractCegarLoop]: Abstraction has 232 states and 256 transitions. [2024-09-13 10:13:15,596 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 256 transitions. [2024-09-13 10:13:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-09-13 10:13:15,596 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:15,596 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:15,596 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-09-13 10:13:15,596 INFO L399 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:15,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:15,597 INFO L85 PathProgramCache]: Analyzing trace with hash 604821604, now seen corresponding path program 1 times [2024-09-13 10:13:15,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:15,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747224160] [2024-09-13 10:13:15,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:15,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:15,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:15,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747224160] [2024-09-13 10:13:15,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747224160] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:15,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:15,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:15,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173241674] [2024-09-13 10:13:15,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:15,675 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:15,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:15,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:15,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:15,675 INFO L87 Difference]: Start difference. First operand 232 states and 256 transitions. Second operand has 5 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:15,906 INFO L93 Difference]: Finished difference Result 236 states and 264 transitions. [2024-09-13 10:13:15,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:15,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-09-13 10:13:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:15,907 INFO L225 Difference]: With dead ends: 236 [2024-09-13 10:13:15,907 INFO L226 Difference]: Without dead ends: 236 [2024-09-13 10:13:15,908 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:15,908 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 19 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:15,908 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 192 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-09-13 10:13:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 231. [2024-09-13 10:13:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 207 states have (on average 1.2270531400966183) internal successors, (254), 230 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 254 transitions. [2024-09-13 10:13:15,910 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 254 transitions. Word has length 133 [2024-09-13 10:13:15,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:15,910 INFO L474 AbstractCegarLoop]: Abstraction has 231 states and 254 transitions. [2024-09-13 10:13:15,910 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:15,910 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 254 transitions. [2024-09-13 10:13:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-09-13 10:13:15,910 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:15,911 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:15,911 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-09-13 10:13:15,911 INFO L399 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:15,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:15,911 INFO L85 PathProgramCache]: Analyzing trace with hash 853070366, now seen corresponding path program 1 times [2024-09-13 10:13:15,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:15,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886468769] [2024-09-13 10:13:15,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:15,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:15,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886468769] [2024-09-13 10:13:15,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886468769] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:15,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:15,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:15,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33208725] [2024-09-13 10:13:15,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:15,988 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:15,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:15,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:15,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:15,989 INFO L87 Difference]: Start difference. First operand 231 states and 254 transitions. Second operand has 5 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:16,183 INFO L93 Difference]: Finished difference Result 234 states and 260 transitions. [2024-09-13 10:13:16,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:16,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-09-13 10:13:16,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:16,184 INFO L225 Difference]: With dead ends: 234 [2024-09-13 10:13:16,184 INFO L226 Difference]: Without dead ends: 234 [2024-09-13 10:13:16,184 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:16,185 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 19 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:16,185 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 188 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:16,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-09-13 10:13:16,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2024-09-13 10:13:16,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 207 states have (on average 1.2173913043478262) internal successors, (252), 229 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2024-09-13 10:13:16,189 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 136 [2024-09-13 10:13:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:16,189 INFO L474 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2024-09-13 10:13:16,189 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2024-09-13 10:13:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-09-13 10:13:16,190 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:16,190 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:16,190 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-09-13 10:13:16,190 INFO L399 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:16,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:16,190 INFO L85 PathProgramCache]: Analyzing trace with hash 498265302, now seen corresponding path program 1 times [2024-09-13 10:13:16,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:16,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101100134] [2024-09-13 10:13:16,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:16,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:16,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:16,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101100134] [2024-09-13 10:13:16,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101100134] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:16,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:16,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:16,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816722537] [2024-09-13 10:13:16,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:16,266 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:16,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:16,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:16,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:16,266 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 5 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:16,446 INFO L93 Difference]: Finished difference Result 232 states and 256 transitions. [2024-09-13 10:13:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:16,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2024-09-13 10:13:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:16,447 INFO L225 Difference]: With dead ends: 232 [2024-09-13 10:13:16,447 INFO L226 Difference]: Without dead ends: 232 [2024-09-13 10:13:16,447 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:16,447 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 16 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:16,447 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 188 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-09-13 10:13:16,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2024-09-13 10:13:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 207 states have (on average 1.2077294685990339) internal successors, (250), 228 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 250 transitions. [2024-09-13 10:13:16,449 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 250 transitions. Word has length 139 [2024-09-13 10:13:16,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:16,449 INFO L474 AbstractCegarLoop]: Abstraction has 229 states and 250 transitions. [2024-09-13 10:13:16,449 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 250 transitions. [2024-09-13 10:13:16,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-09-13 10:13:16,450 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:16,450 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:16,450 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-09-13 10:13:16,450 INFO L399 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:16,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:16,450 INFO L85 PathProgramCache]: Analyzing trace with hash 415129042, now seen corresponding path program 1 times [2024-09-13 10:13:16,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:16,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264965942] [2024-09-13 10:13:16,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:16,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:16,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:16,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264965942] [2024-09-13 10:13:16,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264965942] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:16,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:16,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:16,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667331588] [2024-09-13 10:13:16,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:16,528 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:16,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:16,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:16,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:16,529 INFO L87 Difference]: Start difference. First operand 229 states and 250 transitions. Second operand has 5 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:16,749 INFO L93 Difference]: Finished difference Result 230 states and 252 transitions. [2024-09-13 10:13:16,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:16,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 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 10:13:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:16,750 INFO L225 Difference]: With dead ends: 230 [2024-09-13 10:13:16,750 INFO L226 Difference]: Without dead ends: 230 [2024-09-13 10:13:16,751 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:16,751 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 12 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:16,751 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 192 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-09-13 10:13:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2024-09-13 10:13:16,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 207 states have (on average 1.1980676328502415) internal successors, (248), 227 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:16,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2024-09-13 10:13:16,753 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 142 [2024-09-13 10:13:16,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:16,753 INFO L474 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2024-09-13 10:13:16,753 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2024-09-13 10:13:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-09-13 10:13:16,753 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:16,753 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:16,754 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-09-13 10:13:16,754 INFO L399 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:16,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:16,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1898947216, now seen corresponding path program 1 times [2024-09-13 10:13:16,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:16,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229334822] [2024-09-13 10:13:16,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:16,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:16,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:16,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229334822] [2024-09-13 10:13:16,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229334822] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:16,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:16,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:16,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991697877] [2024-09-13 10:13:16,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:16,827 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:16,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:16,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:16,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:16,827 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand has 5 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:17,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:17,084 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2024-09-13 10:13:17,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:17,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-09-13 10:13:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:17,085 INFO L225 Difference]: With dead ends: 228 [2024-09-13 10:13:17,085 INFO L226 Difference]: Without dead ends: 228 [2024-09-13 10:13:17,085 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:17,085 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:17,085 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 192 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:17,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-09-13 10:13:17,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2024-09-13 10:13:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 207 states have (on average 1.1884057971014492) internal successors, (246), 226 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 246 transitions. [2024-09-13 10:13:17,087 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 246 transitions. Word has length 145 [2024-09-13 10:13:17,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:17,087 INFO L474 AbstractCegarLoop]: Abstraction has 227 states and 246 transitions. [2024-09-13 10:13:17,087 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 246 transitions. [2024-09-13 10:13:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-09-13 10:13:17,088 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:17,088 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:17,088 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-09-13 10:13:17,088 INFO L399 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:17,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:17,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1772198970, now seen corresponding path program 1 times [2024-09-13 10:13:17,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:17,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159262109] [2024-09-13 10:13:17,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:17,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:17,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:17,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159262109] [2024-09-13 10:13:17,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159262109] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:17,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:17,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:17,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848775555] [2024-09-13 10:13:17,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:17,167 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:17,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:17,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:17,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:17,168 INFO L87 Difference]: Start difference. First operand 227 states and 246 transitions. Second operand has 5 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:17,339 INFO L93 Difference]: Finished difference Result 226 states and 244 transitions. [2024-09-13 10:13:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:17,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 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 10:13:17,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:17,340 INFO L225 Difference]: With dead ends: 226 [2024-09-13 10:13:17,340 INFO L226 Difference]: Without dead ends: 226 [2024-09-13 10:13:17,340 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:17,340 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 8 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:17,340 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 188 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-09-13 10:13:17,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-09-13 10:13:17,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 207 states have (on average 1.178743961352657) internal successors, (244), 225 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:17,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 244 transitions. [2024-09-13 10:13:17,342 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 244 transitions. Word has length 148 [2024-09-13 10:13:17,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:17,342 INFO L474 AbstractCegarLoop]: Abstraction has 226 states and 244 transitions. [2024-09-13 10:13:17,342 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:17,342 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 244 transitions. [2024-09-13 10:13:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-09-13 10:13:17,342 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:17,343 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:17,343 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-09-13 10:13:17,343 INFO L399 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:17,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:17,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1840990844, now seen corresponding path program 1 times [2024-09-13 10:13:17,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:17,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840126661] [2024-09-13 10:13:17,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:17,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:17,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:17,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840126661] [2024-09-13 10:13:17,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840126661] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:17,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:17,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:17,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193113516] [2024-09-13 10:13:17,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:17,423 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:17,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:17,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:17,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:17,424 INFO L87 Difference]: Start difference. First operand 226 states and 244 transitions. Second operand has 5 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:17,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:17,597 INFO L93 Difference]: Finished difference Result 224 states and 241 transitions. [2024-09-13 10:13:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:17,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2024-09-13 10:13:17,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:17,598 INFO L225 Difference]: With dead ends: 224 [2024-09-13 10:13:17,598 INFO L226 Difference]: Without dead ends: 224 [2024-09-13 10:13:17,598 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:17,599 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:17,599 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 188 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:17,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-09-13 10:13:17,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-09-13 10:13:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 206 states have (on average 1.1699029126213591) internal successors, (241), 223 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 241 transitions. [2024-09-13 10:13:17,600 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 241 transitions. Word has length 151 [2024-09-13 10:13:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:17,601 INFO L474 AbstractCegarLoop]: Abstraction has 224 states and 241 transitions. [2024-09-13 10:13:17,601 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 241 transitions. [2024-09-13 10:13:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-09-13 10:13:17,601 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:17,601 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:17,601 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-09-13 10:13:17,601 INFO L399 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:17,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:17,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1774675906, now seen corresponding path program 1 times [2024-09-13 10:13:17,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:17,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377750485] [2024-09-13 10:13:17,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:17,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377750485] [2024-09-13 10:13:17,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377750485] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:17,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:17,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:17,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128109133] [2024-09-13 10:13:17,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:17,716 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:17,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:17,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:17,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:17,717 INFO L87 Difference]: Start difference. First operand 224 states and 241 transitions. Second operand has 5 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:17,914 INFO L93 Difference]: Finished difference Result 223 states and 239 transitions. [2024-09-13 10:13:17,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:17,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2024-09-13 10:13:17,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:17,915 INFO L225 Difference]: With dead ends: 223 [2024-09-13 10:13:17,915 INFO L226 Difference]: Without dead ends: 223 [2024-09-13 10:13:17,915 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:17,915 INFO L434 NwaCegarLoop]: 151 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:17,915 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 187 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:17,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-09-13 10:13:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-09-13 10:13:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 206 states have (on average 1.1601941747572815) internal successors, (239), 222 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 239 transitions. [2024-09-13 10:13:17,919 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 239 transitions. Word has length 154 [2024-09-13 10:13:17,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:17,919 INFO L474 AbstractCegarLoop]: Abstraction has 223 states and 239 transitions. [2024-09-13 10:13:17,919 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 239 transitions. [2024-09-13 10:13:17,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-09-13 10:13:17,920 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:17,920 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:17,920 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-09-13 10:13:17,920 INFO L399 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:17,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1676949050, now seen corresponding path program 1 times [2024-09-13 10:13:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:17,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278716542] [2024-09-13 10:13:17,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:17,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:18,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:18,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278716542] [2024-09-13 10:13:18,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278716542] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:18,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:18,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:18,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500302229] [2024-09-13 10:13:18,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:18,015 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:18,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:18,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:18,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:18,015 INFO L87 Difference]: Start difference. First operand 223 states and 239 transitions. Second operand has 5 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:18,295 INFO L93 Difference]: Finished difference Result 222 states and 237 transitions. [2024-09-13 10:13:18,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:18,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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 10:13:18,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:18,296 INFO L225 Difference]: With dead ends: 222 [2024-09-13 10:13:18,296 INFO L226 Difference]: Without dead ends: 222 [2024-09-13 10:13:18,296 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:18,296 INFO L434 NwaCegarLoop]: 150 mSDtfsCounter, 66 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:18,296 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 154 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:18,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-09-13 10:13:18,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2024-09-13 10:13:18,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 206 states have (on average 1.1504854368932038) internal successors, (237), 221 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 237 transitions. [2024-09-13 10:13:18,298 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 237 transitions. Word has length 157 [2024-09-13 10:13:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:18,298 INFO L474 AbstractCegarLoop]: Abstraction has 222 states and 237 transitions. [2024-09-13 10:13:18,298 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:18,298 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 237 transitions. [2024-09-13 10:13:18,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-09-13 10:13:18,299 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:18,299 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:18,299 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-09-13 10:13:18,299 INFO L399 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:18,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:18,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997060, now seen corresponding path program 1 times [2024-09-13 10:13:18,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:18,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133449625] [2024-09-13 10:13:18,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:18,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:18,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:18,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133449625] [2024-09-13 10:13:18,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133449625] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:18,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:18,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:18,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756817536] [2024-09-13 10:13:18,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:18,394 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:18,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:18,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:18,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:18,395 INFO L87 Difference]: Start difference. First operand 222 states and 237 transitions. Second operand has 5 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:18,613 INFO L93 Difference]: Finished difference Result 221 states and 235 transitions. [2024-09-13 10:13:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:18,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 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 10:13:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:18,614 INFO L225 Difference]: With dead ends: 221 [2024-09-13 10:13:18,614 INFO L226 Difference]: Without dead ends: 221 [2024-09-13 10:13:18,615 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:18,615 INFO L434 NwaCegarLoop]: 149 mSDtfsCounter, 62 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:18,615 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 153 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:18,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-09-13 10:13:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-09-13 10:13:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 206 states have (on average 1.1407766990291262) internal successors, (235), 220 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:18,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 235 transitions. [2024-09-13 10:13:18,617 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 235 transitions. Word has length 160 [2024-09-13 10:13:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:18,617 INFO L474 AbstractCegarLoop]: Abstraction has 221 states and 235 transitions. [2024-09-13 10:13:18,617 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 235 transitions. [2024-09-13 10:13:18,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-09-13 10:13:18,617 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:18,617 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:18,617 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-09-13 10:13:18,617 INFO L399 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:18,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:18,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1238059512, now seen corresponding path program 1 times [2024-09-13 10:13:18,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:18,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151159456] [2024-09-13 10:13:18,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:18,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:18,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:18,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151159456] [2024-09-13 10:13:18,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151159456] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:18,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:18,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:18,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711656471] [2024-09-13 10:13:18,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:18,734 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:18,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:18,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:18,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:18,735 INFO L87 Difference]: Start difference. First operand 221 states and 235 transitions. Second operand has 5 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:18,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:18,971 INFO L93 Difference]: Finished difference Result 220 states and 233 transitions. [2024-09-13 10:13:18,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:18,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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 10:13:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:18,972 INFO L225 Difference]: With dead ends: 220 [2024-09-13 10:13:18,972 INFO L226 Difference]: Without dead ends: 220 [2024-09-13 10:13:18,972 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:18,972 INFO L434 NwaCegarLoop]: 148 mSDtfsCounter, 60 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:18,972 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 152 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-09-13 10:13:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-09-13 10:13:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 206 states have (on average 1.1310679611650485) internal successors, (233), 219 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 233 transitions. [2024-09-13 10:13:18,974 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 233 transitions. Word has length 163 [2024-09-13 10:13:18,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:18,974 INFO L474 AbstractCegarLoop]: Abstraction has 220 states and 233 transitions. [2024-09-13 10:13:18,974 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:18,974 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 233 transitions. [2024-09-13 10:13:18,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-09-13 10:13:18,974 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:18,974 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:18,974 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-09-13 10:13:18,975 INFO L399 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:18,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2146173754, now seen corresponding path program 1 times [2024-09-13 10:13:18,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:18,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002306531] [2024-09-13 10:13:18,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:19,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:19,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002306531] [2024-09-13 10:13:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002306531] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:19,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:19,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550876117] [2024-09-13 10:13:19,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:19,065 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:19,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:19,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:19,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:19,065 INFO L87 Difference]: Start difference. First operand 220 states and 233 transitions. Second operand has 5 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:19,309 INFO L93 Difference]: Finished difference Result 219 states and 231 transitions. [2024-09-13 10:13:19,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:19,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2024-09-13 10:13:19,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:19,310 INFO L225 Difference]: With dead ends: 219 [2024-09-13 10:13:19,310 INFO L226 Difference]: Without dead ends: 219 [2024-09-13 10:13:19,310 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:19,310 INFO L434 NwaCegarLoop]: 147 mSDtfsCounter, 54 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:19,310 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 151 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-09-13 10:13:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-09-13 10:13:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 206 states have (on average 1.1213592233009708) internal successors, (231), 218 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 231 transitions. [2024-09-13 10:13:19,312 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 231 transitions. Word has length 166 [2024-09-13 10:13:19,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:19,312 INFO L474 AbstractCegarLoop]: Abstraction has 219 states and 231 transitions. [2024-09-13 10:13:19,312 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:19,312 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 231 transitions. [2024-09-13 10:13:19,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-09-13 10:13:19,313 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:19,313 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:19,313 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-09-13 10:13:19,313 INFO L399 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:19,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:19,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1778550196, now seen corresponding path program 1 times [2024-09-13 10:13:19,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:19,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284507238] [2024-09-13 10:13:19,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:19,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:19,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:19,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284507238] [2024-09-13 10:13:19,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284507238] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:19,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:19,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:19,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347787044] [2024-09-13 10:13:19,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:19,404 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:19,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:19,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:19,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:19,405 INFO L87 Difference]: Start difference. First operand 219 states and 231 transitions. Second operand has 5 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:19,609 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2024-09-13 10:13:19,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:19,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2024-09-13 10:13:19,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:19,610 INFO L225 Difference]: With dead ends: 218 [2024-09-13 10:13:19,610 INFO L226 Difference]: Without dead ends: 218 [2024-09-13 10:13:19,610 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:19,610 INFO L434 NwaCegarLoop]: 146 mSDtfsCounter, 52 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:19,610 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 150 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-09-13 10:13:19,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-09-13 10:13:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 206 states have (on average 1.1116504854368932) internal successors, (229), 217 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 229 transitions. [2024-09-13 10:13:19,612 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 229 transitions. Word has length 169 [2024-09-13 10:13:19,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:19,612 INFO L474 AbstractCegarLoop]: Abstraction has 218 states and 229 transitions. [2024-09-13 10:13:19,612 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 229 transitions. [2024-09-13 10:13:19,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-09-13 10:13:19,613 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:19,613 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:19,613 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-09-13 10:13:19,613 INFO L399 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:19,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:19,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2071729146, now seen corresponding path program 1 times [2024-09-13 10:13:19,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:19,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150836651] [2024-09-13 10:13:19,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:19,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:19,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:19,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150836651] [2024-09-13 10:13:19,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150836651] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:19,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:19,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:19,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71435160] [2024-09-13 10:13:19,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:19,705 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:19,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:19,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:19,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:19,705 INFO L87 Difference]: Start difference. First operand 218 states and 229 transitions. Second operand has 5 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:19,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:19,910 INFO L93 Difference]: Finished difference Result 217 states and 227 transitions. [2024-09-13 10:13:19,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:19,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2024-09-13 10:13:19,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:19,911 INFO L225 Difference]: With dead ends: 217 [2024-09-13 10:13:19,911 INFO L226 Difference]: Without dead ends: 217 [2024-09-13 10:13:19,911 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:19,912 INFO L434 NwaCegarLoop]: 145 mSDtfsCounter, 48 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:19,912 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 149 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:19,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-09-13 10:13:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-09-13 10:13:19,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 206 states have (on average 1.1019417475728155) internal successors, (227), 216 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 227 transitions. [2024-09-13 10:13:19,914 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 227 transitions. Word has length 172 [2024-09-13 10:13:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:19,914 INFO L474 AbstractCegarLoop]: Abstraction has 217 states and 227 transitions. [2024-09-13 10:13:19,914 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 227 transitions. [2024-09-13 10:13:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-09-13 10:13:19,914 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:19,914 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:19,914 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-09-13 10:13:19,915 INFO L399 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:19,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:19,915 INFO L85 PathProgramCache]: Analyzing trace with hash -202339058, now seen corresponding path program 1 times [2024-09-13 10:13:19,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:19,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853018866] [2024-09-13 10:13:19,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:19,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:20,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:20,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853018866] [2024-09-13 10:13:20,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853018866] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:20,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:20,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:20,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629718523] [2024-09-13 10:13:20,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:20,008 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:20,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:20,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:20,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:20,008 INFO L87 Difference]: Start difference. First operand 217 states and 227 transitions. Second operand has 5 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:20,208 INFO L93 Difference]: Finished difference Result 216 states and 225 transitions. [2024-09-13 10:13:20,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:20,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2024-09-13 10:13:20,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:20,209 INFO L225 Difference]: With dead ends: 216 [2024-09-13 10:13:20,209 INFO L226 Difference]: Without dead ends: 216 [2024-09-13 10:13:20,209 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:20,209 INFO L434 NwaCegarLoop]: 144 mSDtfsCounter, 42 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:20,209 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 148 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-09-13 10:13:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-09-13 10:13:20,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 206 states have (on average 1.0922330097087378) internal successors, (225), 215 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 225 transitions. [2024-09-13 10:13:20,211 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 225 transitions. Word has length 175 [2024-09-13 10:13:20,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:20,211 INFO L474 AbstractCegarLoop]: Abstraction has 216 states and 225 transitions. [2024-09-13 10:13:20,211 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:20,211 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 225 transitions. [2024-09-13 10:13:20,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-09-13 10:13:20,212 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:20,212 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:20,212 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-09-13 10:13:20,212 INFO L399 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:20,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:20,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2043145074, now seen corresponding path program 1 times [2024-09-13 10:13:20,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:20,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851752317] [2024-09-13 10:13:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:20,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:20,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:20,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851752317] [2024-09-13 10:13:20,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851752317] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:20,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:20,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:20,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355979818] [2024-09-13 10:13:20,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:20,304 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:20,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:20,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:20,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:20,305 INFO L87 Difference]: Start difference. First operand 216 states and 225 transitions. Second operand has 5 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:20,490 INFO L93 Difference]: Finished difference Result 215 states and 223 transitions. [2024-09-13 10:13:20,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:20,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2024-09-13 10:13:20,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:20,491 INFO L225 Difference]: With dead ends: 215 [2024-09-13 10:13:20,491 INFO L226 Difference]: Without dead ends: 215 [2024-09-13 10:13:20,491 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:20,491 INFO L434 NwaCegarLoop]: 143 mSDtfsCounter, 40 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:20,491 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 147 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-09-13 10:13:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-09-13 10:13:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 206 states have (on average 1.0825242718446602) internal successors, (223), 214 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 223 transitions. [2024-09-13 10:13:20,493 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 223 transitions. Word has length 178 [2024-09-13 10:13:20,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:20,493 INFO L474 AbstractCegarLoop]: Abstraction has 215 states and 223 transitions. [2024-09-13 10:13:20,493 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 223 transitions. [2024-09-13 10:13:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-09-13 10:13:20,494 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:20,494 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:20,494 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-09-13 10:13:20,494 INFO L399 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:20,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:20,494 INFO L85 PathProgramCache]: Analyzing trace with hash 942244368, now seen corresponding path program 1 times [2024-09-13 10:13:20,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:20,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298773764] [2024-09-13 10:13:20,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:20,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:20,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:20,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298773764] [2024-09-13 10:13:20,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298773764] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:20,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:20,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:20,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864593788] [2024-09-13 10:13:20,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:20,585 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:20,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:20,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:20,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:20,586 INFO L87 Difference]: Start difference. First operand 215 states and 223 transitions. Second operand has 5 states, 4 states have (on average 45.25) internal successors, (181), 4 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 10:13:20,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:20,832 INFO L93 Difference]: Finished difference Result 214 states and 221 transitions. [2024-09-13 10:13:20,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:20,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 45.25) internal successors, (181), 4 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 181 [2024-09-13 10:13:20,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:20,834 INFO L225 Difference]: With dead ends: 214 [2024-09-13 10:13:20,834 INFO L226 Difference]: Without dead ends: 214 [2024-09-13 10:13:20,834 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:20,834 INFO L434 NwaCegarLoop]: 142 mSDtfsCounter, 36 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:20,834 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 146 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:20,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-09-13 10:13:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-09-13 10:13:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 206 states have (on average 1.0728155339805825) internal successors, (221), 213 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 221 transitions. [2024-09-13 10:13:20,836 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 221 transitions. Word has length 181 [2024-09-13 10:13:20,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:20,836 INFO L474 AbstractCegarLoop]: Abstraction has 214 states and 221 transitions. [2024-09-13 10:13:20,836 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 45.25) internal successors, (181), 4 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 10:13:20,836 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 221 transitions. [2024-09-13 10:13:20,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-09-13 10:13:20,837 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:20,837 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:20,837 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-09-13 10:13:20,837 INFO L399 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:20,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:20,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1503645104, now seen corresponding path program 1 times [2024-09-13 10:13:20,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:20,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024004333] [2024-09-13 10:13:20,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:20,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:20,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:20,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024004333] [2024-09-13 10:13:20,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024004333] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:20,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:20,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:20,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715005519] [2024-09-13 10:13:20,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:20,928 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:20,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:20,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:20,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:20,928 INFO L87 Difference]: Start difference. First operand 214 states and 221 transitions. Second operand has 5 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:21,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:21,118 INFO L93 Difference]: Finished difference Result 213 states and 219 transitions. [2024-09-13 10:13:21,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:21,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2024-09-13 10:13:21,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:21,119 INFO L225 Difference]: With dead ends: 213 [2024-09-13 10:13:21,119 INFO L226 Difference]: Without dead ends: 213 [2024-09-13 10:13:21,119 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:21,120 INFO L434 NwaCegarLoop]: 141 mSDtfsCounter, 32 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:21,120 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 145 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:21,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-09-13 10:13:21,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-09-13 10:13:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 206 states have (on average 1.0631067961165048) internal successors, (219), 212 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 219 transitions. [2024-09-13 10:13:21,121 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 219 transitions. Word has length 184 [2024-09-13 10:13:21,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:21,121 INFO L474 AbstractCegarLoop]: Abstraction has 213 states and 219 transitions. [2024-09-13 10:13:21,122 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 219 transitions. [2024-09-13 10:13:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-09-13 10:13:21,127 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:21,127 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:21,127 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-09-13 10:13:21,127 INFO L399 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:21,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:21,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1418247954, now seen corresponding path program 1 times [2024-09-13 10:13:21,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:21,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882977187] [2024-09-13 10:13:21,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:21,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:21,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:21,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882977187] [2024-09-13 10:13:21,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882977187] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:21,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:21,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:21,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000793116] [2024-09-13 10:13:21,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:21,245 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:21,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:21,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:21,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:21,245 INFO L87 Difference]: Start difference. First operand 213 states and 219 transitions. Second operand has 5 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:21,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:21,425 INFO L93 Difference]: Finished difference Result 212 states and 217 transitions. [2024-09-13 10:13:21,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:21,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 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 187 [2024-09-13 10:13:21,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:21,426 INFO L225 Difference]: With dead ends: 212 [2024-09-13 10:13:21,426 INFO L226 Difference]: Without dead ends: 212 [2024-09-13 10:13:21,427 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:21,427 INFO L434 NwaCegarLoop]: 140 mSDtfsCounter, 26 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:21,427 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 144 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-09-13 10:13:21,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-09-13 10:13:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.0533980582524272) internal successors, (217), 211 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 217 transitions. [2024-09-13 10:13:21,428 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 217 transitions. Word has length 187 [2024-09-13 10:13:21,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:21,429 INFO L474 AbstractCegarLoop]: Abstraction has 212 states and 217 transitions. [2024-09-13 10:13:21,429 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 217 transitions. [2024-09-13 10:13:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-09-13 10:13:21,429 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:21,430 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:21,430 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-09-13 10:13:21,430 INFO L399 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:21,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:21,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1432160274, now seen corresponding path program 1 times [2024-09-13 10:13:21,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:21,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453300601] [2024-09-13 10:13:21,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:21,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:21,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:21,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453300601] [2024-09-13 10:13:21,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453300601] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:21,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:21,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:21,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152047194] [2024-09-13 10:13:21,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:21,525 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:21,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:21,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:21,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:21,526 INFO L87 Difference]: Start difference. First operand 212 states and 217 transitions. Second operand has 5 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:21,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:21,721 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2024-09-13 10:13:21,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:21,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 0 states have call successors, (0), 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 190 [2024-09-13 10:13:21,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:21,722 INFO L225 Difference]: With dead ends: 211 [2024-09-13 10:13:21,722 INFO L226 Difference]: Without dead ends: 211 [2024-09-13 10:13:21,723 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:21,723 INFO L434 NwaCegarLoop]: 139 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:21,723 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 143 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-09-13 10:13:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-09-13 10:13:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.0436893203883495) internal successors, (215), 210 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 215 transitions. [2024-09-13 10:13:21,724 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 215 transitions. Word has length 190 [2024-09-13 10:13:21,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:21,725 INFO L474 AbstractCegarLoop]: Abstraction has 211 states and 215 transitions. [2024-09-13 10:13:21,725 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 215 transitions. [2024-09-13 10:13:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-09-13 10:13:21,725 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:21,725 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:21,725 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-09-13 10:13:21,725 INFO L399 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:21,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:21,726 INFO L85 PathProgramCache]: Analyzing trace with hash -717732844, now seen corresponding path program 1 times [2024-09-13 10:13:21,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:21,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971530009] [2024-09-13 10:13:21,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:21,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:21,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:21,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971530009] [2024-09-13 10:13:21,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971530009] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:21,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:21,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:21,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826705973] [2024-09-13 10:13:21,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:21,820 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:21,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:21,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:21,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:21,822 INFO L87 Difference]: Start difference. First operand 211 states and 215 transitions. Second operand has 5 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:22,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:22,046 INFO L93 Difference]: Finished difference Result 210 states and 213 transitions. [2024-09-13 10:13:22,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:22,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 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 193 [2024-09-13 10:13:22,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:22,046 INFO L225 Difference]: With dead ends: 210 [2024-09-13 10:13:22,047 INFO L226 Difference]: Without dead ends: 210 [2024-09-13 10:13:22,047 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:22,047 INFO L434 NwaCegarLoop]: 138 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:22,047 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 142 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:22,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-09-13 10:13:22,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-09-13 10:13:22,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 206 states have (on average 1.0339805825242718) internal successors, (213), 209 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 213 transitions. [2024-09-13 10:13:22,049 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 213 transitions. Word has length 193 [2024-09-13 10:13:22,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:22,049 INFO L474 AbstractCegarLoop]: Abstraction has 210 states and 213 transitions. [2024-09-13 10:13:22,049 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:22,049 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 213 transitions. [2024-09-13 10:13:22,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-09-13 10:13:22,053 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:22,054 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:22,054 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-09-13 10:13:22,054 INFO L399 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:22,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:22,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1631283756, now seen corresponding path program 1 times [2024-09-13 10:13:22,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:22,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351699377] [2024-09-13 10:13:22,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:22,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:22,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:22,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351699377] [2024-09-13 10:13:22,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351699377] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:22,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:22,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:22,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546946726] [2024-09-13 10:13:22,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:22,150 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:22,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:22,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:22,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:22,151 INFO L87 Difference]: Start difference. First operand 210 states and 213 transitions. Second operand has 5 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:22,328 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2024-09-13 10:13:22,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:22,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 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 196 [2024-09-13 10:13:22,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:22,329 INFO L225 Difference]: With dead ends: 209 [2024-09-13 10:13:22,329 INFO L226 Difference]: Without dead ends: 209 [2024-09-13 10:13:22,329 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:22,329 INFO L434 NwaCegarLoop]: 137 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:22,329 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 141 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-09-13 10:13:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-09-13 10:13:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 206 states have (on average 1.0242718446601942) internal successors, (211), 208 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 211 transitions. [2024-09-13 10:13:22,331 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 211 transitions. Word has length 196 [2024-09-13 10:13:22,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:22,331 INFO L474 AbstractCegarLoop]: Abstraction has 209 states and 211 transitions. [2024-09-13 10:13:22,331 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 211 transitions. [2024-09-13 10:13:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-09-13 10:13:22,332 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:22,332 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:22,332 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-09-13 10:13:22,332 INFO L399 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:22,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash -18738922, now seen corresponding path program 1 times [2024-09-13 10:13:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:22,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296024174] [2024-09-13 10:13:22,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:22,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:22,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:22,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296024174] [2024-09-13 10:13:22,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296024174] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:22,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:22,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:22,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233198859] [2024-09-13 10:13:22,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:22,434 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:22,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:22,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:22,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:22,435 INFO L87 Difference]: Start difference. First operand 209 states and 211 transitions. Second operand has 5 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:22,649 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2024-09-13 10:13:22,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:22,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2024-09-13 10:13:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:22,650 INFO L225 Difference]: With dead ends: 208 [2024-09-13 10:13:22,650 INFO L226 Difference]: Without dead ends: 208 [2024-09-13 10:13:22,650 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:22,650 INFO L434 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:22,650 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 140 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-09-13 10:13:22,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-09-13 10:13:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 206 states have (on average 1.0145631067961165) internal successors, (209), 207 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2024-09-13 10:13:22,652 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 199 [2024-09-13 10:13:22,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:22,652 INFO L474 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2024-09-13 10:13:22,652 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2024-09-13 10:13:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-09-13 10:13:22,652 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:22,652 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:22,652 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-09-13 10:13:22,653 INFO L399 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:22,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:22,653 INFO L85 PathProgramCache]: Analyzing trace with hash 95214474, now seen corresponding path program 1 times [2024-09-13 10:13:22,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:22,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077739633] [2024-09-13 10:13:22,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:22,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:22,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:22,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077739633] [2024-09-13 10:13:22,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077739633] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:22,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:22,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975579347] [2024-09-13 10:13:22,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:22,774 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:22,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:22,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:22,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:22,774 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand has 5 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:23,036 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2024-09-13 10:13:23,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:23,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2024-09-13 10:13:23,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:23,040 INFO L225 Difference]: With dead ends: 211 [2024-09-13 10:13:23,040 INFO L226 Difference]: Without dead ends: 211 [2024-09-13 10:13:23,040 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:23,040 INFO L434 NwaCegarLoop]: 136 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:23,041 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-09-13 10:13:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-09-13 10:13:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 209 states have (on average 1.014354066985646) internal successors, (212), 210 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2024-09-13 10:13:23,042 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 202 [2024-09-13 10:13:23,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:23,042 INFO L474 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2024-09-13 10:13:23,042 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2024-09-13 10:13:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-09-13 10:13:23,043 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:23,043 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:23,043 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-09-13 10:13:23,043 INFO L399 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:23,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:23,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1856680139, now seen corresponding path program 1 times [2024-09-13 10:13:23,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:23,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646148392] [2024-09-13 10:13:23,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:23,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:23,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:23,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646148392] [2024-09-13 10:13:23,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646148392] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:13:23,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473872907] [2024-09-13 10:13:23,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:23,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:13:23,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:13:23,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:13:23,205 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 10:13:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:23,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 10:13:23,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:13:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:23,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:13:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:23,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473872907] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:13:23,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:13:23,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-09-13 10:13:23,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362716386] [2024-09-13 10:13:23,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:13:23,765 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 10:13:23,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:23,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 10:13:23,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-13 10:13:23,766 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand has 6 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:23,999 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2024-09-13 10:13:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 10:13:24,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2024-09-13 10:13:24,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:24,000 INFO L225 Difference]: With dead ends: 214 [2024-09-13 10:13:24,000 INFO L226 Difference]: Without dead ends: 214 [2024-09-13 10:13:24,000 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-13 10:13:24,001 INFO L434 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:24,001 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 142 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:24,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-09-13 10:13:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-09-13 10:13:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 1.0141509433962264) internal successors, (215), 213 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 215 transitions. [2024-09-13 10:13:24,003 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 215 transitions. Word has length 205 [2024-09-13 10:13:24,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:24,003 INFO L474 AbstractCegarLoop]: Abstraction has 214 states and 215 transitions. [2024-09-13 10:13:24,003 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 215 transitions. [2024-09-13 10:13:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-09-13 10:13:24,003 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:24,004 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:24,016 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 10:13:24,204 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2024-09-13 10:13:24,204 INFO L399 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:24,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1769883626, now seen corresponding path program 2 times [2024-09-13 10:13:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:24,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000305874] [2024-09-13 10:13:24,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:24,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:24,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000305874] [2024-09-13 10:13:24,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000305874] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:13:24,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154157124] [2024-09-13 10:13:24,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 10:13:24,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:13:24,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:13:24,383 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 10:13:24,384 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 10:13:24,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 10:13:24,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 10:13:24,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-13 10:13:24,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:13:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:24,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:13:24,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:24,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154157124] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:13:24,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:13:24,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-09-13 10:13:24,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471801421] [2024-09-13 10:13:24,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:13:24,937 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 10:13:24,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:24,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 10:13:24,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:13:24,938 INFO L87 Difference]: Start difference. First operand 214 states and 215 transitions. Second operand has 7 states, 6 states have (on average 34.666666666666664) internal successors, (208), 6 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:25,252 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2024-09-13 10:13:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 10:13:25,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 34.666666666666664) internal successors, (208), 6 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2024-09-13 10:13:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:25,253 INFO L225 Difference]: With dead ends: 217 [2024-09-13 10:13:25,253 INFO L226 Difference]: Without dead ends: 217 [2024-09-13 10:13:25,254 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:13:25,254 INFO L434 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:25,254 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-09-13 10:13:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-09-13 10:13:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 215 states have (on average 1.013953488372093) internal successors, (218), 216 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2024-09-13 10:13:25,256 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 208 [2024-09-13 10:13:25,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:25,256 INFO L474 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2024-09-13 10:13:25,256 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 34.666666666666664) internal successors, (208), 6 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:25,256 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2024-09-13 10:13:25,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-09-13 10:13:25,257 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:25,257 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:25,270 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-13 10:13:25,457 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2024-09-13 10:13:25,457 INFO L399 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:25,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:25,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1585277035, now seen corresponding path program 3 times [2024-09-13 10:13:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:25,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925776405] [2024-09-13 10:13:25,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:25,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:25,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:25,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925776405] [2024-09-13 10:13:25,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925776405] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:13:25,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904260291] [2024-09-13 10:13:25,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 10:13:25,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:13:25,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:13:25,671 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 10:13:25,672 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 10:13:25,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-13 10:13:25,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 10:13:25,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-09-13 10:13:25,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:13:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-13 10:13:27,211 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 10:13:27,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904260291] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:27,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 10:13:27,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-09-13 10:13:27,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130669692] [2024-09-13 10:13:27,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:27,212 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 10:13:27,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:27,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 10:13:27,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-09-13 10:13:27,212 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand has 6 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:28,406 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2024-09-13 10:13:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 10:13:28,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 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 211 [2024-09-13 10:13:28,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:28,407 INFO L225 Difference]: With dead ends: 216 [2024-09-13 10:13:28,407 INFO L226 Difference]: Without dead ends: 216 [2024-09-13 10:13:28,407 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-09-13 10:13:28,408 INFO L434 NwaCegarLoop]: 136 mSDtfsCounter, 5 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:28,408 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 142 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-13 10:13:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-09-13 10:13:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2024-09-13 10:13:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.0046728971962617) internal successors, (215), 214 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2024-09-13 10:13:28,409 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 211 [2024-09-13 10:13:28,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:28,410 INFO L474 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2024-09-13 10:13:28,410 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2024-09-13 10:13:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-09-13 10:13:28,411 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:28,411 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:28,427 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 10:13:28,611 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2024-09-13 10:13:28,612 INFO L399 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-09-13 10:13:28,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash -471529024, now seen corresponding path program 1 times [2024-09-13 10:13:28,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:28,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131164398] [2024-09-13 10:13:28,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:28,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 10:13:29,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:29,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131164398] [2024-09-13 10:13:29,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131164398] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:29,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:29,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:13:29,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473700675] [2024-09-13 10:13:29,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:29,294 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:13:29,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:29,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:13:29,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:13:29,294 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:29,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:29,465 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2024-09-13 10:13:29,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:13:29,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 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 214 [2024-09-13 10:13:29,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:29,466 INFO L225 Difference]: With dead ends: 213 [2024-09-13 10:13:29,466 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 10:13:29,466 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:13:29,466 INFO L434 NwaCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:29,467 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:13:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 10:13:29,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 10:13:29,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 10:13:29,467 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2024-09-13 10:13:29,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:29,467 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 10:13:29,467 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:29,467 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 10:13:29,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 10:13:29,469 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 68 remaining) [2024-09-13 10:13:29,469 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 68 remaining) [2024-09-13 10:13:29,469 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 68 remaining) [2024-09-13 10:13:29,469 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 68 remaining) [2024-09-13 10:13:29,469 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 68 remaining) [2024-09-13 10:13:29,469 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 68 remaining) [2024-09-13 10:13:29,470 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 68 remaining) [2024-09-13 10:13:29,471 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 68 remaining) [2024-09-13 10:13:29,472 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION (0 of 68 remaining) [2024-09-13 10:13:29,473 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-09-13 10:13:29,475 INFO L408 BasicCegarLoop]: Path program histogram: [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:29,476 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 10:13:29,477 INFO L469 ceAbstractionStarter]: Automizer considered 67 witness invariants [2024-09-13 10:13:29,477 INFO L470 ceAbstractionStarter]: WitnessConsidered=67 [2024-09-13 10:13:29,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 10:13:29 BoogieIcfgContainer [2024-09-13 10:13:29,478 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 10:13:29,478 INFO L158 Benchmark]: Toolchain (without parser) took 33104.45ms. Allocated memory was 142.6MB in the beginning and 406.8MB in the end (delta: 264.2MB). Free memory was 68.7MB in the beginning and 127.6MB in the end (delta: -59.0MB). Peak memory consumption was 207.4MB. Max. memory is 16.1GB. [2024-09-13 10:13:29,479 INFO L158 Benchmark]: Witness Parser took 0.09ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 108.1MB in the end (delta: 297.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:13:29,479 INFO L158 Benchmark]: CDTParser took 0.07ms. Allocated memory is still 142.6MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:13:29,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.24ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 68.3MB in the beginning and 154.3MB in the end (delta: -86.0MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2024-09-13 10:13:29,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.36ms. Allocated memory is still 192.9MB. Free memory was 154.3MB in the beginning and 151.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 10:13:29,479 INFO L158 Benchmark]: Boogie Preprocessor took 70.34ms. Allocated memory is still 192.9MB. Free memory was 151.1MB in the beginning and 145.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-13 10:13:29,479 INFO L158 Benchmark]: RCFGBuilder took 864.10ms. Allocated memory is still 192.9MB. Free memory was 145.9MB in the beginning and 138.2MB in the end (delta: 7.7MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-09-13 10:13:29,479 INFO L158 Benchmark]: TraceAbstraction took 31634.42ms. Allocated memory was 192.9MB in the beginning and 406.8MB in the end (delta: 213.9MB). Free memory was 137.2MB in the beginning and 127.6MB in the end (delta: 9.5MB). Peak memory consumption was 225.5MB. Max. memory is 16.1GB. [2024-09-13 10:13:29,480 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.09ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 108.1MB in the end (delta: 297.3kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.07ms. Allocated memory is still 142.6MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.24ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 68.3MB in the beginning and 154.3MB in the end (delta: -86.0MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.36ms. Allocated memory is still 192.9MB. Free memory was 154.3MB in the beginning and 151.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.34ms. Allocated memory is still 192.9MB. Free memory was 151.1MB in the beginning and 145.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 864.10ms. Allocated memory is still 192.9MB. Free memory was 145.9MB in the beginning and 138.2MB in the end (delta: 7.7MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * TraceAbstraction took 31634.42ms. Allocated memory was 192.9MB in the beginning and 406.8MB in the end (delta: 213.9MB). Free memory was 137.2MB in the beginning and 127.6MB in the end (delta: 9.5MB). Peak memory consumption was 225.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 71]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 77]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 83]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 89]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 95]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 101]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 107]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 113]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 119]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 125]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 131]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 137]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 143]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 149]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 155]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 161]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 167]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 173]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 179]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 185]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 191]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 197]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 203]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 209]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 215]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 221]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 227]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 233]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 239]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 245]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 251]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 257]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 263]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 269]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 275]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 281]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 287]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 293]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 299]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 305]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 311]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 317]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 323]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 329]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 335]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 341]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 347]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 353]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 359]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 365]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 371]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 377]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 383]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 389]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 395]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 401]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 407]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 413]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 420]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 444]: 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, 276 locations, 68 error locations. Started 1 CEGAR loops. OverallTime: 31.6s, OverallIterations: 71, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 21.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3937 SdHoareTripleChecker+Valid, 20.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3937 mSDsluCounter, 12531 SdHoareTripleChecker+Invalid, 16.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1976 mSDsCounter, 1272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48289 IncrementalHoareTripleChecker+Invalid, 49561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1272 mSolverCounterUnsat, 10555 mSDtfsCounter, 48289 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1253 GetRequests, 1032 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=0, InterpolantAutomatonStates: 358, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 71 MinimizatonAttempts, 1129 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 8363 NumberOfCodeBlocks, 8360 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 8700 ConstructedInterpolants, 0 QuantifiedInterpolants, 43495 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2324 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 76 InterpolantComputations, 69 PerfectInterpolantSequences, 27/57 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 68 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 10:13:29,509 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