./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 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+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-5189fb6-m [2024-09-13 05:15:09,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 05:15:09,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 05:15:09,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 05:15:09,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 05:15:09,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 05:15:09,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 05:15:09,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 05:15:09,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 05:15:09,379 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 05:15:09,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 05:15:09,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 05:15:09,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 05:15:09,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 05:15:09,381 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 05:15:09,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 05:15:09,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 05:15:09,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 05:15:09,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 05:15:09,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 05:15:09,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 05:15:09,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 05:15:09,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 05:15:09,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 05:15:09,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 05:15:09,385 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 05:15:09,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 05:15:09,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 05:15:09,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 05:15:09,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 05:15:09,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 05:15:09,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 05:15:09,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:15:09,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 05:15:09,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 05:15:09,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 05:15:09,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 05:15:09,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 05:15:09,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 05:15:09,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 05:15:09,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 05:15:09,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 05:15:09,389 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-13 05:15:09,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 05:15:09,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 05:15:09,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 05:15:09,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 05:15:09,626 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 05:15:09,627 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 05:15:11,017 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 05:15:11,226 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 05:15:11,228 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2024-09-13 05:15:11,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/819c82819/c47a70de1f7243a2877ad9c49c4c0ed1/FLAGddcfea8f0 [2024-09-13 05:15:11,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/819c82819/c47a70de1f7243a2877ad9c49c4c0ed1 [2024-09-13 05:15:11,583 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 05:15:11,583 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 05:15:11,584 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 05:15:11,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 05:15:11,688 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 05:15:11,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 05:15:11,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 05:15:11,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 05:15:11,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:15:11" (1/2) ... [2024-09-13 05:15:11,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df92252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:11, skipping insertion in model container [2024-09-13 05:15:11,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:15:11" (1/2) ... [2024-09-13 05:15:11,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3726b8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:15:11, skipping insertion in model container [2024-09-13 05:15:11,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:15:11" (2/2) ... [2024-09-13 05:15:11,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df92252 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:11, skipping insertion in model container [2024-09-13 05:15:11,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:15:11" (2/2) ... [2024-09-13 05:15:11,738 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 05:15:11,739 INFO L1541 ArrayList]: Location invariant before [L77-L1137] (((10 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,739 INFO L1541 ArrayList]: Location invariant before [L107-L1077] (((15 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,739 INFO L1541 ArrayList]: Location invariant before [L95-L1101] (((13 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,740 INFO L1541 ArrayList]: Location invariant before [L233-L825] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (36 == main__x)) [2024-09-13 05:15:11,740 INFO L1541 ArrayList]: Location invariant before [L143-L1005] (((21 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,740 INFO L1541 ArrayList]: Location invariant before [L71-L1149] (((9 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,740 INFO L1541 ArrayList]: Location invariant before [L59-L1173] (((7 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,741 INFO L1541 ArrayList]: Location invariant before [L197-L897] (((main__y == 50) && (30 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,741 INFO L1541 ArrayList]: Location invariant before [L251-L789] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (39 == main__x)) [2024-09-13 05:15:11,741 INFO L1541 ArrayList]: Location invariant before [L155-L981] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (23 == main__x)) [2024-09-13 05:15:11,742 INFO L1541 ArrayList]: Location invariant before [L269-L753] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (42 == main__x)) [2024-09-13 05:15:11,742 INFO L1541 ArrayList]: Location invariant before [L41-L1209] (((4 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,742 INFO L1541 ArrayList]: Location invariant before [L323-L645] (((51 == main__y) && (51 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,742 INFO L1541 ArrayList]: Location invariant before [L299-L693] (((main__y == 50) && (47 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,742 INFO L1541 ArrayList]: Location invariant before [L23-L1245] (((main__x == 1) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,742 INFO L1541 ArrayList]: Location invariant before [L329-L633] (((52 == main__y) && (\old(__return_1121) == __return_1121)) && (52 == main__x)) [2024-09-13 05:15:11,743 INFO L1541 ArrayList]: Location invariant before [L113-L1065] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (16 == main__x)) [2024-09-13 05:15:11,743 INFO L1541 ArrayList]: Location invariant before [L185-L921] (((28 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,743 INFO L1541 ArrayList]: Location invariant before [L35-L1221] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (3 == main__x)) [2024-09-13 05:15:11,743 INFO L1541 ArrayList]: Location invariant before [L281-L729] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (44 == main__x)) [2024-09-13 05:15:11,743 INFO L1541 ArrayList]: Location invariant before [L65-L1161] (((8 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,743 INFO L1541 ArrayList]: Location invariant before [L167-L957] (((25 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,743 INFO L1541 ArrayList]: Location invariant before [L173-L945] (((26 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,744 INFO L1541 ArrayList]: Location invariant before [L119-L1053] (((main__y == 50) && (17 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,744 INFO L1541 ArrayList]: Location invariant before [L389-L513] (((62 == main__x) && (62 == main__y)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,744 INFO L1541 ArrayList]: Location invariant before [L215-L861] (((33 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,744 INFO L1541 ArrayList]: Location invariant before [L83-L1125] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (11 == main__x)) [2024-09-13 05:15:11,744 INFO L1541 ArrayList]: Location invariant before [L227-L837] (((35 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,744 INFO L1541 ArrayList]: Location invariant before [L245-L801] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (38 == main__x)) [2024-09-13 05:15:11,744 INFO L1541 ArrayList]: Location invariant before [L89-L1113] (((12 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,744 INFO L1541 ArrayList]: Location invariant before [L53-L1185] (((main__y == 50) && (6 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,744 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 05:15:11,745 INFO L1541 ArrayList]: Location invariant before [L407-L477] (((65 == main__y) && (\old(__return_1121) == __return_1121)) && (65 == main__x)) [2024-09-13 05:15:11,745 INFO L1541 ArrayList]: Location invariant before [L149-L993] (((22 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,745 INFO L1541 ArrayList]: Location invariant before [L413-L465] (((66 == main__y) && (66 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,745 INFO L1541 ArrayList]: Location invariant before [L203-L885] (((31 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,745 INFO L1541 ArrayList]: Location invariant before [L317-L657] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (main__x == 50)) [2024-09-13 05:15:11,745 INFO L1541 ArrayList]: Location invariant before [L263-L765] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (41 == main__x)) [2024-09-13 05:15:11,746 INFO L1541 ArrayList]: Location invariant before [L131-L1029] (((main__y == 50) && (19 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,747 INFO L1541 ArrayList]: Location invariant before [L29-L1233] (((2 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,747 INFO L1541 ArrayList]: Location invariant before [L371-L549] (((59 == main__y) && (\old(__return_1121) == __return_1121)) && (59 == main__x)) [2024-09-13 05:15:11,748 INFO L1541 ArrayList]: Location invariant before [L305-L681] (((48 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,748 INFO L1541 ArrayList]: Location invariant before [L395-L501] (((63 == main__x) && (63 == main__y)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,748 INFO L1541 ArrayList]: Location invariant before [L161-L969] (((main__x == 24) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,748 INFO L1541 ArrayList]: Location invariant before [L191-L909] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (29 == main__x)) [2024-09-13 05:15:11,748 INFO L1541 ArrayList]: Location invariant before [L101-L1089] (((14 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,749 INFO L1541 ArrayList]: Location invariant before [L257-L777] (((main__y == 50) && (40 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,749 INFO L1541 ArrayList]: Location invariant before [L359-L573] (((\old(__return_1121) == __return_1121) && (57 == main__x)) && (57 == main__y)) [2024-09-13 05:15:11,749 INFO L1541 ArrayList]: Location invariant before [L377-L537] (((60 == main__x) && (60 == main__y)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,749 INFO L1541 ArrayList]: Location invariant before [L275-L741] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (43 == main__x)) [2024-09-13 05:15:11,750 INFO L1541 ArrayList]: Location invariant before [L365-L561] (((58 == main__y) && (\old(__return_1121) == __return_1121)) && (58 == main__x)) [2024-09-13 05:15:11,750 INFO L1541 ArrayList]: Location invariant before [L179-L933] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (main__x == 27)) [2024-09-13 05:15:11,750 INFO L1541 ArrayList]: Location invariant before [L401-L489] (((64 == main__x) && (64 == main__y)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,750 INFO L1541 ArrayList]: Location invariant before [L353-L585] (((56 == main__x) && (\old(__return_1121) == __return_1121)) && (56 == main__y)) [2024-09-13 05:15:11,750 INFO L1541 ArrayList]: Location invariant before [L221-L849] (((main__y == 50) && (34 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,750 INFO L1541 ArrayList]: Location invariant before [L209-L873] (((32 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,750 INFO L1541 ArrayList]: Location invariant before [L293-L705] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (46 == main__x)) [2024-09-13 05:15:11,750 INFO L1541 ArrayList]: Location invariant before [L287-L717] (((main__y == 50) && (45 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,751 INFO L1541 ArrayList]: Location invariant before [L137-L1017] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (20 == main__x)) [2024-09-13 05:15:11,751 INFO L1541 ArrayList]: Location invariant before [L347-L597] (((55 == main__x) && (\old(__return_1121) == __return_1121)) && (55 == main__y)) [2024-09-13 05:15:11,751 INFO L1541 ArrayList]: Location invariant before [L383-L525] (((main__x == 61) && (main__y == 61)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,751 INFO L1541 ArrayList]: Location invariant before [L239-L813] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (37 == main__x)) [2024-09-13 05:15:11,751 INFO L1541 ArrayList]: Location invariant before [L125-L1041] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (18 == main__x)) [2024-09-13 05:15:11,751 INFO L1541 ArrayList]: Location invariant before [L47-L1197] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (5 == main__x)) [2024-09-13 05:15:11,751 INFO L1541 ArrayList]: Location invariant before [L335-L621] (((53 == main__y) && (53 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,751 INFO L1541 ArrayList]: Location invariant before [L311-L669] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (49 == main__x)) [2024-09-13 05:15:11,751 INFO L1541 ArrayList]: Location invariant before [L341-L609] (((main__y == 54) && (main__x == 54)) && (\old(__return_1121) == __return_1121)) [2024-09-13 05:15:11,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 05:15:12,011 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 05:15:12,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:15:12,090 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 05:15:12,123 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 05:15:12,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:15:12,258 INFO L204 MainTranslator]: Completed translation [2024-09-13 05:15:12,258 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:12 WrapperNode [2024-09-13 05:15:12,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 05:15:12,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 05:15:12,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 05:15:12,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 05:15:12,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:12" (1/1) ... [2024-09-13 05:15:12,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:12" (1/1) ... [2024-09-13 05:15:12,330 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 771 [2024-09-13 05:15:12,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 05:15:12,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 05:15:12,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 05:15:12,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 05:15:12,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:12" (1/1) ... [2024-09-13 05:15:12,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:12" (1/1) ... [2024-09-13 05:15:12,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:12" (1/1) ... [2024-09-13 05:15:12,363 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-13 05:15:12,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:12" (1/1) ... [2024-09-13 05:15:12,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:12" (1/1) ... [2024-09-13 05:15:12,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:12" (1/1) ... [2024-09-13 05:15:12,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:12" (1/1) ... [2024-09-13 05:15:12,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:12" (1/1) ... [2024-09-13 05:15:12,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:12" (1/1) ... [2024-09-13 05:15:12,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 05:15:12,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 05:15:12,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 05:15:12,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 05:15:12,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:12" (1/1) ... [2024-09-13 05:15:12,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:15:12,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:15:12,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 05:15:12,447 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 05:15:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 05:15:12,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 05:15:12,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 05:15:12,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 05:15:12,565 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 05:15:12,567 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 05:15:13,389 INFO L? ?]: Removed 275 outVars from TransFormulas that were not future-live. [2024-09-13 05:15:13,389 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 05:15:13,473 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 05:15:13,473 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-13 05:15:13,473 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:15:13 BoogieIcfgContainer [2024-09-13 05:15:13,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 05:15:13,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 05:15:13,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 05:15:13,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 05:15:13,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 05:15:11" (1/4) ... [2024-09-13 05:15:13,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e39f74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:15:13, skipping insertion in model container [2024-09-13 05:15:13,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:15:11" (2/4) ... [2024-09-13 05:15:13,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e39f74e and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:15:13, skipping insertion in model container [2024-09-13 05:15:13,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:15:12" (3/4) ... [2024-09-13 05:15:13,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e39f74e and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:15:13, skipping insertion in model container [2024-09-13 05:15:13,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:15:13" (4/4) ... [2024-09-13 05:15:13,486 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2024-09-13 05:15:13,503 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 05:15:13,503 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 68 error locations. [2024-09-13 05:15:13,560 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 05:15:13,568 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;@f61c6e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 05:15:13,568 INFO L337 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2024-09-13 05:15:13,574 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 05:15:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-09-13 05:15:13,582 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:13,583 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-09-13 05:15:13,583 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 05:15:13,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:13,592 INFO L85 PathProgramCache]: Analyzing trace with hash 29588506, now seen corresponding path program 1 times [2024-09-13 05:15:13,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:13,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666600499] [2024-09-13 05:15:13,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:13,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:13,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:13,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666600499] [2024-09-13 05:15:13,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666600499] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:13,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:13,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:15:13,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358483485] [2024-09-13 05:15:13,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:13,940 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:15:13,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:13,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:15:13,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:15:13,968 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 05:15:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:14,750 INFO L93 Difference]: Finished difference Result 275 states and 406 transitions. [2024-09-13 05:15:14,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:15:14,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-09-13 05:15:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:14,767 INFO L225 Difference]: With dead ends: 275 [2024-09-13 05:15:14,767 INFO L226 Difference]: Without dead ends: 273 [2024-09-13 05:15:14,769 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 05:15:14,775 INFO L434 NwaCegarLoop]: 267 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:14,775 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.7s Time] [2024-09-13 05:15:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-09-13 05:15:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-09-13 05:15:14,819 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 05:15:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 339 transitions. [2024-09-13 05:15:14,822 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 339 transitions. Word has length 4 [2024-09-13 05:15:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:14,822 INFO L474 AbstractCegarLoop]: Abstraction has 273 states and 339 transitions. [2024-09-13 05:15:14,823 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 339 transitions. [2024-09-13 05:15:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-13 05:15:14,823 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:14,823 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:14,824 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 05:15:14,824 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 05:15:14,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:14,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1002932306, now seen corresponding path program 1 times [2024-09-13 05:15:14,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:14,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123248518] [2024-09-13 05:15:14,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:14,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:14,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:14,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123248518] [2024-09-13 05:15:14,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123248518] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:14,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:14,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:14,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455307450] [2024-09-13 05:15:14,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:14,973 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:14,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:14,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:14,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:14,975 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 05:15:15,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:15,850 INFO L93 Difference]: Finished difference Result 320 states and 432 transitions. [2024-09-13 05:15:15,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:15,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-09-13 05:15:15,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:15,853 INFO L225 Difference]: With dead ends: 320 [2024-09-13 05:15:15,853 INFO L226 Difference]: Without dead ends: 320 [2024-09-13 05:15:15,853 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 05:15:15,854 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 124 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:15,855 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.8s Time] [2024-09-13 05:15:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-09-13 05:15:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 273. [2024-09-13 05:15:15,867 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 05:15:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 338 transitions. [2024-09-13 05:15:15,869 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 338 transitions. Word has length 7 [2024-09-13 05:15:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:15,869 INFO L474 AbstractCegarLoop]: Abstraction has 273 states and 338 transitions. [2024-09-13 05:15:15,869 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 338 transitions. [2024-09-13 05:15:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-13 05:15:15,870 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:15,871 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:15,871 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 05:15:15,871 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 05:15:15,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1731094578, now seen corresponding path program 1 times [2024-09-13 05:15:15,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:15,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942030756] [2024-09-13 05:15:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:15,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:15,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942030756] [2024-09-13 05:15:15,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942030756] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:15,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:15,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:15,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635290975] [2024-09-13 05:15:15,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:15,976 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:15,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:15,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:15,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:15,977 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 05:15:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:16,649 INFO L93 Difference]: Finished difference Result 318 states and 428 transitions. [2024-09-13 05:15:16,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:16,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-09-13 05:15:16,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:16,651 INFO L225 Difference]: With dead ends: 318 [2024-09-13 05:15:16,651 INFO L226 Difference]: Without dead ends: 318 [2024-09-13 05:15:16,651 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 05:15:16,652 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 122 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.7s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:16,653 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.7s Time] [2024-09-13 05:15:16,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-09-13 05:15:16,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 272. [2024-09-13 05:15:16,678 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 05:15:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 336 transitions. [2024-09-13 05:15:16,679 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 336 transitions. Word has length 10 [2024-09-13 05:15:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:16,679 INFO L474 AbstractCegarLoop]: Abstraction has 272 states and 336 transitions. [2024-09-13 05:15:16,679 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 336 transitions. [2024-09-13 05:15:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-13 05:15:16,680 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:16,680 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:16,680 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 05:15:16,680 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 05:15:16,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:16,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1366184436, now seen corresponding path program 1 times [2024-09-13 05:15:16,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:16,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279119013] [2024-09-13 05:15:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:16,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:16,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:16,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279119013] [2024-09-13 05:15:16,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279119013] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:16,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:16,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:16,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022818255] [2024-09-13 05:15:16,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:16,764 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:16,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:16,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:16,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:16,765 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 05:15:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:17,248 INFO L93 Difference]: Finished difference Result 316 states and 424 transitions. [2024-09-13 05:15:17,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:17,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-09-13 05:15:17,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:17,250 INFO L225 Difference]: With dead ends: 316 [2024-09-13 05:15:17,250 INFO L226 Difference]: Without dead ends: 316 [2024-09-13 05:15:17,250 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 05:15:17,251 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 121 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:17,252 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.5s Time] [2024-09-13 05:15:17,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-09-13 05:15:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 271. [2024-09-13 05:15:17,259 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 05:15:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2024-09-13 05:15:17,260 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 13 [2024-09-13 05:15:17,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:17,260 INFO L474 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2024-09-13 05:15:17,260 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2024-09-13 05:15:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 05:15:17,261 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:17,261 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:17,261 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 05:15:17,261 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 05:15:17,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:17,262 INFO L85 PathProgramCache]: Analyzing trace with hash -890360382, now seen corresponding path program 1 times [2024-09-13 05:15:17,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:17,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894953467] [2024-09-13 05:15:17,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:17,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:17,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:17,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:17,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894953467] [2024-09-13 05:15:17,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894953467] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:17,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:17,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:17,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655891956] [2024-09-13 05:15:17,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:17,334 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:17,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:17,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:17,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:17,335 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 05:15:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:17,790 INFO L93 Difference]: Finished difference Result 314 states and 420 transitions. [2024-09-13 05:15:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:17,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-09-13 05:15:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:17,791 INFO L225 Difference]: With dead ends: 314 [2024-09-13 05:15:17,792 INFO L226 Difference]: Without dead ends: 314 [2024-09-13 05:15:17,792 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 05:15:17,793 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 119 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:17,793 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.4s Time] [2024-09-13 05:15:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-09-13 05:15:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 270. [2024-09-13 05:15:17,798 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 05:15:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 332 transitions. [2024-09-13 05:15:17,799 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 332 transitions. Word has length 16 [2024-09-13 05:15:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:17,800 INFO L474 AbstractCegarLoop]: Abstraction has 270 states and 332 transitions. [2024-09-13 05:15:17,800 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 332 transitions. [2024-09-13 05:15:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 05:15:17,800 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:17,800 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:17,800 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 05:15:17,801 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 05:15:17,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:17,801 INFO L85 PathProgramCache]: Analyzing trace with hash 991965440, now seen corresponding path program 1 times [2024-09-13 05:15:17,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:17,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039020954] [2024-09-13 05:15:17,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:17,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:17,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:17,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039020954] [2024-09-13 05:15:17,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039020954] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:17,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:17,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:17,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128413182] [2024-09-13 05:15:17,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:17,928 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:17,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:17,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:17,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:17,929 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 05:15:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:18,589 INFO L93 Difference]: Finished difference Result 312 states and 416 transitions. [2024-09-13 05:15:18,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:18,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-09-13 05:15:18,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:18,591 INFO L225 Difference]: With dead ends: 312 [2024-09-13 05:15:18,591 INFO L226 Difference]: Without dead ends: 312 [2024-09-13 05:15:18,592 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 05:15:18,593 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 114 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:18,593 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.6s Time] [2024-09-13 05:15:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-09-13 05:15:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 269. [2024-09-13 05:15:18,598 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 05:15:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 330 transitions. [2024-09-13 05:15:18,599 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 330 transitions. Word has length 19 [2024-09-13 05:15:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:18,600 INFO L474 AbstractCegarLoop]: Abstraction has 269 states and 330 transitions. [2024-09-13 05:15:18,600 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 330 transitions. [2024-09-13 05:15:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-13 05:15:18,601 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:18,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] [2024-09-13 05:15:18,601 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 05:15:18,601 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 05:15:18,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:18,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2027445322, now seen corresponding path program 1 times [2024-09-13 05:15:18,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:18,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721257575] [2024-09-13 05:15:18,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:18,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:18,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:18,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721257575] [2024-09-13 05:15:18,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721257575] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:18,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:18,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:18,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323397221] [2024-09-13 05:15:18,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:18,704 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:18,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:18,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:18,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:18,706 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 05:15:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:19,259 INFO L93 Difference]: Finished difference Result 310 states and 412 transitions. [2024-09-13 05:15:19,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:19,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-09-13 05:15:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:19,261 INFO L225 Difference]: With dead ends: 310 [2024-09-13 05:15:19,261 INFO L226 Difference]: Without dead ends: 310 [2024-09-13 05:15:19,261 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 05:15:19,262 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 112 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:19,262 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.5s Time] [2024-09-13 05:15:19,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-09-13 05:15:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 268. [2024-09-13 05:15:19,266 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 05:15:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 328 transitions. [2024-09-13 05:15:19,267 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 328 transitions. Word has length 22 [2024-09-13 05:15:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:19,268 INFO L474 AbstractCegarLoop]: Abstraction has 268 states and 328 transitions. [2024-09-13 05:15:19,268 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 328 transitions. [2024-09-13 05:15:19,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-13 05:15:19,269 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:19,269 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:19,269 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 05:15:19,269 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 05:15:19,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:19,270 INFO L85 PathProgramCache]: Analyzing trace with hash 501601268, now seen corresponding path program 1 times [2024-09-13 05:15:19,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:19,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014986090] [2024-09-13 05:15:19,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:19,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:19,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:19,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014986090] [2024-09-13 05:15:19,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014986090] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:19,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:19,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:19,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053202863] [2024-09-13 05:15:19,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:19,353 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:19,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:19,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:19,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:19,354 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 05:15:19,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:19,886 INFO L93 Difference]: Finished difference Result 308 states and 408 transitions. [2024-09-13 05:15:19,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:19,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-09-13 05:15:19,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:19,888 INFO L225 Difference]: With dead ends: 308 [2024-09-13 05:15:19,888 INFO L226 Difference]: Without dead ends: 308 [2024-09-13 05:15:19,888 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 05:15:19,889 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 109 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:19,889 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.5s Time] [2024-09-13 05:15:19,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-09-13 05:15:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 267. [2024-09-13 05:15:19,897 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 05:15:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 326 transitions. [2024-09-13 05:15:19,898 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 326 transitions. Word has length 25 [2024-09-13 05:15:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:19,899 INFO L474 AbstractCegarLoop]: Abstraction has 267 states and 326 transitions. [2024-09-13 05:15:19,899 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 326 transitions. [2024-09-13 05:15:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-13 05:15:19,900 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:19,901 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:19,901 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 05:15:19,901 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 05:15:19,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:19,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1012267434, now seen corresponding path program 1 times [2024-09-13 05:15:19,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:19,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308536086] [2024-09-13 05:15:19,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:19,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:19,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 05:15:19,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:19,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308536086] [2024-09-13 05:15:19,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308536086] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:19,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:19,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:19,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322045006] [2024-09-13 05:15:19,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:19,988 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:19,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:19,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:19,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:19,990 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 05:15:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:20,390 INFO L93 Difference]: Finished difference Result 306 states and 404 transitions. [2024-09-13 05:15:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:20,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-09-13 05:15:20,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:20,391 INFO L225 Difference]: With dead ends: 306 [2024-09-13 05:15:20,391 INFO L226 Difference]: Without dead ends: 306 [2024-09-13 05:15:20,392 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 05:15:20,392 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:20,392 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.4s Time] [2024-09-13 05:15:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-09-13 05:15:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 266. [2024-09-13 05:15:20,397 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 05:15:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2024-09-13 05:15:20,398 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 28 [2024-09-13 05:15:20,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:20,398 INFO L474 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2024-09-13 05:15:20,398 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2024-09-13 05:15:20,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-13 05:15:20,399 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:20,399 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:20,399 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-13 05:15:20,400 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 05:15:20,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:20,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1493866216, now seen corresponding path program 1 times [2024-09-13 05:15:20,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:20,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784821321] [2024-09-13 05:15:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:20,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:20,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:20,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784821321] [2024-09-13 05:15:20,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784821321] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:20,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:20,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:20,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982639240] [2024-09-13 05:15:20,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:20,477 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:20,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:20,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:20,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:20,478 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 05:15:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:20,935 INFO L93 Difference]: Finished difference Result 304 states and 400 transitions. [2024-09-13 05:15:20,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:20,935 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 05:15:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:20,936 INFO L225 Difference]: With dead ends: 304 [2024-09-13 05:15:20,936 INFO L226 Difference]: Without dead ends: 304 [2024-09-13 05:15:20,937 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 05:15:20,937 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 106 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:20,937 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.4s Time] [2024-09-13 05:15:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-09-13 05:15:20,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 265. [2024-09-13 05:15:20,942 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 05:15:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 322 transitions. [2024-09-13 05:15:20,943 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 322 transitions. Word has length 31 [2024-09-13 05:15:20,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:20,943 INFO L474 AbstractCegarLoop]: Abstraction has 265 states and 322 transitions. [2024-09-13 05:15:20,944 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 05:15:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 322 transitions. [2024-09-13 05:15:20,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-13 05:15:20,944 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:20,944 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 05:15:20,945 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-13 05:15:20,945 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 05:15:20,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:20,945 INFO L85 PathProgramCache]: Analyzing trace with hash -682545250, now seen corresponding path program 1 times [2024-09-13 05:15:20,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:20,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153095313] [2024-09-13 05:15:20,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:20,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:21,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:21,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153095313] [2024-09-13 05:15:21,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153095313] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:21,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:21,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:21,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270884179] [2024-09-13 05:15:21,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:21,027 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:21,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:21,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:21,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:21,027 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 05:15:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:21,407 INFO L93 Difference]: Finished difference Result 302 states and 396 transitions. [2024-09-13 05:15:21,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:21,407 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 05:15:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:21,408 INFO L225 Difference]: With dead ends: 302 [2024-09-13 05:15:21,408 INFO L226 Difference]: Without dead ends: 302 [2024-09-13 05:15:21,408 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 05:15:21,409 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 104 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:21,409 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.4s Time] [2024-09-13 05:15:21,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-09-13 05:15:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 264. [2024-09-13 05:15:21,413 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 05:15:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 320 transitions. [2024-09-13 05:15:21,414 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 320 transitions. Word has length 34 [2024-09-13 05:15:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:21,414 INFO L474 AbstractCegarLoop]: Abstraction has 264 states and 320 transitions. [2024-09-13 05:15:21,414 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 05:15:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 320 transitions. [2024-09-13 05:15:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 05:15:21,415 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:21,415 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 05:15:21,416 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-13 05:15:21,416 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 05:15:21,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1330218530, now seen corresponding path program 1 times [2024-09-13 05:15:21,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:21,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409965070] [2024-09-13 05:15:21,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:21,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:21,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:21,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409965070] [2024-09-13 05:15:21,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409965070] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:21,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:21,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:21,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162323702] [2024-09-13 05:15:21,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:21,515 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:21,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:21,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:21,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:21,516 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 05:15:22,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:22,030 INFO L93 Difference]: Finished difference Result 300 states and 392 transitions. [2024-09-13 05:15:22,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:22,030 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 05:15:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:22,031 INFO L225 Difference]: With dead ends: 300 [2024-09-13 05:15:22,031 INFO L226 Difference]: Without dead ends: 300 [2024-09-13 05:15:22,032 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 05:15:22,032 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 99 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:22,032 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.5s Time] [2024-09-13 05:15:22,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-09-13 05:15:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 263. [2024-09-13 05:15:22,036 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 05:15:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 318 transitions. [2024-09-13 05:15:22,037 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 318 transitions. Word has length 37 [2024-09-13 05:15:22,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:22,037 INFO L474 AbstractCegarLoop]: Abstraction has 263 states and 318 transitions. [2024-09-13 05:15:22,038 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 05:15:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 318 transitions. [2024-09-13 05:15:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-13 05:15:22,038 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:22,038 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 05:15:22,039 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-13 05:15:22,039 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 05:15:22,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:22,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1123167824, now seen corresponding path program 1 times [2024-09-13 05:15:22,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:22,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509930103] [2024-09-13 05:15:22,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:22,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:22,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509930103] [2024-09-13 05:15:22,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509930103] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:22,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:22,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:22,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311086584] [2024-09-13 05:15:22,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:22,115 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:22,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:22,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:22,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:22,116 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 05:15:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:22,573 INFO L93 Difference]: Finished difference Result 298 states and 388 transitions. [2024-09-13 05:15:22,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:22,574 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 05:15:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:22,575 INFO L225 Difference]: With dead ends: 298 [2024-09-13 05:15:22,575 INFO L226 Difference]: Without dead ends: 298 [2024-09-13 05:15:22,575 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 05:15:22,576 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 97 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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 05:15:22,576 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 05:15:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-09-13 05:15:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 262. [2024-09-13 05:15:22,580 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 05:15:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 316 transitions. [2024-09-13 05:15:22,581 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 316 transitions. Word has length 40 [2024-09-13 05:15:22,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:22,581 INFO L474 AbstractCegarLoop]: Abstraction has 262 states and 316 transitions. [2024-09-13 05:15:22,581 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 05:15:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 316 transitions. [2024-09-13 05:15:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-13 05:15:22,582 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:22,582 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 05:15:22,582 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-13 05:15:22,582 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 05:15:22,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1797393582, now seen corresponding path program 1 times [2024-09-13 05:15:22,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:22,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032358289] [2024-09-13 05:15:22,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:22,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:22,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032358289] [2024-09-13 05:15:22,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032358289] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:22,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:22,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:22,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110489369] [2024-09-13 05:15:22,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:22,692 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:22,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:22,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:22,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:22,693 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 05:15:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:23,116 INFO L93 Difference]: Finished difference Result 296 states and 384 transitions. [2024-09-13 05:15:23,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:23,116 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 05:15:23,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:23,118 INFO L225 Difference]: With dead ends: 296 [2024-09-13 05:15:23,118 INFO L226 Difference]: Without dead ends: 296 [2024-09-13 05:15:23,118 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 05:15:23,118 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 96 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:23,118 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.4s Time] [2024-09-13 05:15:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-09-13 05:15:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 261. [2024-09-13 05:15:23,122 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 05:15:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 314 transitions. [2024-09-13 05:15:23,123 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 314 transitions. Word has length 43 [2024-09-13 05:15:23,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:23,123 INFO L474 AbstractCegarLoop]: Abstraction has 261 states and 314 transitions. [2024-09-13 05:15:23,123 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 05:15:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 314 transitions. [2024-09-13 05:15:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-13 05:15:23,123 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:23,124 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 05:15:23,124 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-13 05:15:23,124 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 05:15:23,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:23,124 INFO L85 PathProgramCache]: Analyzing trace with hash -794747318, now seen corresponding path program 1 times [2024-09-13 05:15:23,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:23,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569212794] [2024-09-13 05:15:23,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:23,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:23,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:23,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569212794] [2024-09-13 05:15:23,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569212794] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:23,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:23,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:23,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451429902] [2024-09-13 05:15:23,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:23,200 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:23,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:23,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:23,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:23,201 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 05:15:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:23,640 INFO L93 Difference]: Finished difference Result 294 states and 380 transitions. [2024-09-13 05:15:23,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:23,640 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 05:15:23,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:23,641 INFO L225 Difference]: With dead ends: 294 [2024-09-13 05:15:23,641 INFO L226 Difference]: Without dead ends: 294 [2024-09-13 05:15:23,641 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 05:15:23,641 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:23,642 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.4s Time] [2024-09-13 05:15:23,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-09-13 05:15:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 260. [2024-09-13 05:15:23,646 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 05:15:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 312 transitions. [2024-09-13 05:15:23,647 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 312 transitions. Word has length 46 [2024-09-13 05:15:23,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:23,648 INFO L474 AbstractCegarLoop]: Abstraction has 260 states and 312 transitions. [2024-09-13 05:15:23,648 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 05:15:23,648 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 312 transitions. [2024-09-13 05:15:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-13 05:15:23,651 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:23,651 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 05:15:23,651 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-13 05:15:23,651 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 05:15:23,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:23,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1837537030, now seen corresponding path program 1 times [2024-09-13 05:15:23,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:23,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116832837] [2024-09-13 05:15:23,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:23,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:23,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 05:15:23,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:23,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116832837] [2024-09-13 05:15:23,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116832837] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:23,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:23,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:23,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060961698] [2024-09-13 05:15:23,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:23,748 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:23,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:23,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:23,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:23,749 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 05:15:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:24,306 INFO L93 Difference]: Finished difference Result 292 states and 376 transitions. [2024-09-13 05:15:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:24,307 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 05:15:24,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:24,308 INFO L225 Difference]: With dead ends: 292 [2024-09-13 05:15:24,308 INFO L226 Difference]: Without dead ends: 292 [2024-09-13 05:15:24,308 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 05:15:24,308 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 89 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:24,308 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.5s Time] [2024-09-13 05:15:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-09-13 05:15:24,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 259. [2024-09-13 05:15:24,313 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 05:15:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 310 transitions. [2024-09-13 05:15:24,314 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 310 transitions. Word has length 49 [2024-09-13 05:15:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:24,315 INFO L474 AbstractCegarLoop]: Abstraction has 259 states and 310 transitions. [2024-09-13 05:15:24,315 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 05:15:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 310 transitions. [2024-09-13 05:15:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-13 05:15:24,315 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:24,316 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 05:15:24,316 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-13 05:15:24,316 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 05:15:24,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1587299458, now seen corresponding path program 1 times [2024-09-13 05:15:24,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:24,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254736652] [2024-09-13 05:15:24,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:24,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:24,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254736652] [2024-09-13 05:15:24,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254736652] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:24,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:24,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:24,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013363141] [2024-09-13 05:15:24,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:24,412 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:24,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:24,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:24,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:24,413 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 05:15:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:24,811 INFO L93 Difference]: Finished difference Result 290 states and 372 transitions. [2024-09-13 05:15:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:24,811 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 05:15:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:24,812 INFO L225 Difference]: With dead ends: 290 [2024-09-13 05:15:24,812 INFO L226 Difference]: Without dead ends: 290 [2024-09-13 05:15:24,812 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 05:15:24,813 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:24,813 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.4s Time] [2024-09-13 05:15:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-09-13 05:15:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 258. [2024-09-13 05:15:24,823 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 05:15:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 308 transitions. [2024-09-13 05:15:24,824 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 308 transitions. Word has length 52 [2024-09-13 05:15:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:24,824 INFO L474 AbstractCegarLoop]: Abstraction has 258 states and 308 transitions. [2024-09-13 05:15:24,824 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 05:15:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 308 transitions. [2024-09-13 05:15:24,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-13 05:15:24,825 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:24,825 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 05:15:24,826 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-13 05:15:24,826 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 05:15:24,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:24,828 INFO L85 PathProgramCache]: Analyzing trace with hash 351980218, now seen corresponding path program 1 times [2024-09-13 05:15:24,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:24,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194988423] [2024-09-13 05:15:24,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:24,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:24,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:24,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194988423] [2024-09-13 05:15:24,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194988423] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:24,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:24,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:24,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577738118] [2024-09-13 05:15:24,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:24,922 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:24,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:24,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:24,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:24,923 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 05:15:25,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:25,374 INFO L93 Difference]: Finished difference Result 288 states and 368 transitions. [2024-09-13 05:15:25,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:25,375 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 05:15:25,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:25,376 INFO L225 Difference]: With dead ends: 288 [2024-09-13 05:15:25,376 INFO L226 Difference]: Without dead ends: 288 [2024-09-13 05:15:25,376 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 05:15:25,377 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 86 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:25,377 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.4s Time] [2024-09-13 05:15:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-09-13 05:15:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 257. [2024-09-13 05:15:25,381 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 05:15:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2024-09-13 05:15:25,381 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 55 [2024-09-13 05:15:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:25,382 INFO L474 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2024-09-13 05:15:25,382 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 05:15:25,382 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2024-09-13 05:15:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-13 05:15:25,383 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:25,383 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 05:15:25,383 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-13 05:15:25,383 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 05:15:25,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:25,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1827719346, now seen corresponding path program 1 times [2024-09-13 05:15:25,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:25,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626414040] [2024-09-13 05:15:25,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:25,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:25,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:25,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626414040] [2024-09-13 05:15:25,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626414040] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:25,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:25,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:25,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018930714] [2024-09-13 05:15:25,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:25,477 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:25,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:25,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:25,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:25,478 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 05:15:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:25,862 INFO L93 Difference]: Finished difference Result 286 states and 364 transitions. [2024-09-13 05:15:25,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:25,863 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 05:15:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:25,864 INFO L225 Difference]: With dead ends: 286 [2024-09-13 05:15:25,864 INFO L226 Difference]: Without dead ends: 286 [2024-09-13 05:15:25,864 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 05:15:25,865 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 84 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:25,865 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.4s Time] [2024-09-13 05:15:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-09-13 05:15:25,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 256. [2024-09-13 05:15:25,868 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 05:15:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 304 transitions. [2024-09-13 05:15:25,868 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 304 transitions. Word has length 58 [2024-09-13 05:15:25,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:25,869 INFO L474 AbstractCegarLoop]: Abstraction has 256 states and 304 transitions. [2024-09-13 05:15:25,869 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 05:15:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 304 transitions. [2024-09-13 05:15:25,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-13 05:15:25,869 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:25,869 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 05:15:25,869 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-13 05:15:25,870 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 05:15:25,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:25,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2008117650, now seen corresponding path program 1 times [2024-09-13 05:15:25,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:25,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14184600] [2024-09-13 05:15:25,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:25,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:25,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:25,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14184600] [2024-09-13 05:15:25,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14184600] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:25,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:25,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:25,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214620342] [2024-09-13 05:15:25,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:25,965 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:25,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:25,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:25,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:25,967 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 05:15:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:26,406 INFO L93 Difference]: Finished difference Result 284 states and 360 transitions. [2024-09-13 05:15:26,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:26,406 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 05:15:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:26,407 INFO L225 Difference]: With dead ends: 284 [2024-09-13 05:15:26,407 INFO L226 Difference]: Without dead ends: 284 [2024-09-13 05:15:26,407 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 05:15:26,408 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 79 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:26,408 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.4s Time] [2024-09-13 05:15:26,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-09-13 05:15:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 255. [2024-09-13 05:15:26,412 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 05:15:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 302 transitions. [2024-09-13 05:15:26,413 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 302 transitions. Word has length 61 [2024-09-13 05:15:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:26,413 INFO L474 AbstractCegarLoop]: Abstraction has 255 states and 302 transitions. [2024-09-13 05:15:26,413 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 05:15:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 302 transitions. [2024-09-13 05:15:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-09-13 05:15:26,414 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:26,414 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 05:15:26,414 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-13 05:15:26,414 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 05:15:26,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash 766789094, now seen corresponding path program 1 times [2024-09-13 05:15:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324772112] [2024-09-13 05:15:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:26,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:26,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324772112] [2024-09-13 05:15:26,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324772112] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:26,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:26,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:26,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535284279] [2024-09-13 05:15:26,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:26,512 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:26,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:26,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:26,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:26,513 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 05:15:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:26,810 INFO L93 Difference]: Finished difference Result 282 states and 356 transitions. [2024-09-13 05:15:26,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:26,811 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 05:15:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:26,811 INFO L225 Difference]: With dead ends: 282 [2024-09-13 05:15:26,811 INFO L226 Difference]: Without dead ends: 282 [2024-09-13 05:15:26,812 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 05:15:26,812 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 05:15:26,812 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 05:15:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-09-13 05:15:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 254. [2024-09-13 05:15:26,815 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 05:15:26,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 300 transitions. [2024-09-13 05:15:26,816 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 300 transitions. Word has length 64 [2024-09-13 05:15:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:26,816 INFO L474 AbstractCegarLoop]: Abstraction has 254 states and 300 transitions. [2024-09-13 05:15:26,817 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 05:15:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 300 transitions. [2024-09-13 05:15:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-13 05:15:26,817 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:26,817 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 05:15:26,818 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-13 05:15:26,818 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 05:15:26,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1516903902, now seen corresponding path program 1 times [2024-09-13 05:15:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:26,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263497568] [2024-09-13 05:15:26,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:26,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:26,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:26,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263497568] [2024-09-13 05:15:26,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263497568] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:26,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:26,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:26,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519926677] [2024-09-13 05:15:26,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:26,909 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:26,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:26,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:26,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:26,910 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 05:15:27,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:27,311 INFO L93 Difference]: Finished difference Result 280 states and 352 transitions. [2024-09-13 05:15:27,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:27,312 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 05:15:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:27,313 INFO L225 Difference]: With dead ends: 280 [2024-09-13 05:15:27,313 INFO L226 Difference]: Without dead ends: 280 [2024-09-13 05:15:27,313 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 05:15:27,313 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:27,314 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.4s Time] [2024-09-13 05:15:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-09-13 05:15:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 253. [2024-09-13 05:15:27,317 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 05:15:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 298 transitions. [2024-09-13 05:15:27,317 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 298 transitions. Word has length 67 [2024-09-13 05:15:27,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:27,318 INFO L474 AbstractCegarLoop]: Abstraction has 253 states and 298 transitions. [2024-09-13 05:15:27,318 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 05:15:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 298 transitions. [2024-09-13 05:15:27,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-13 05:15:27,318 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:27,318 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:27,318 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-13 05:15:27,318 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 05:15:27,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1561998108, now seen corresponding path program 1 times [2024-09-13 05:15:27,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:27,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539357554] [2024-09-13 05:15:27,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:27,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:27,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:27,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539357554] [2024-09-13 05:15:27,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539357554] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:27,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:27,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:27,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173182536] [2024-09-13 05:15:27,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:27,411 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:27,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:27,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:27,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:27,412 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 05:15:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:27,895 INFO L93 Difference]: Finished difference Result 278 states and 348 transitions. [2024-09-13 05:15:27,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:27,895 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 05:15:27,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:27,896 INFO L225 Difference]: With dead ends: 278 [2024-09-13 05:15:27,896 INFO L226 Difference]: Without dead ends: 278 [2024-09-13 05:15:27,897 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 05:15:27,897 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 72 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:27,897 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.5s Time] [2024-09-13 05:15:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-09-13 05:15:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 252. [2024-09-13 05:15:27,900 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 05:15:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 296 transitions. [2024-09-13 05:15:27,901 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 296 transitions. Word has length 70 [2024-09-13 05:15:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:27,901 INFO L474 AbstractCegarLoop]: Abstraction has 252 states and 296 transitions. [2024-09-13 05:15:27,901 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 05:15:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 296 transitions. [2024-09-13 05:15:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-13 05:15:27,902 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:27,902 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 05:15:27,902 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-13 05:15:27,903 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 05:15:27,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:27,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1810214548, now seen corresponding path program 1 times [2024-09-13 05:15:27,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:27,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708856936] [2024-09-13 05:15:27,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:27,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:27,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:27,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708856936] [2024-09-13 05:15:27,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708856936] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:27,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:27,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:27,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371654895] [2024-09-13 05:15:27,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:27,999 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:27,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:28,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:28,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:28,000 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 05:15:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:28,335 INFO L93 Difference]: Finished difference Result 276 states and 344 transitions. [2024-09-13 05:15:28,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:28,335 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 05:15:28,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:28,336 INFO L225 Difference]: With dead ends: 276 [2024-09-13 05:15:28,336 INFO L226 Difference]: Without dead ends: 276 [2024-09-13 05:15:28,336 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 05:15:28,337 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 71 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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 05:15:28,337 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 05:15:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-09-13 05:15:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 251. [2024-09-13 05:15:28,339 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 05:15:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 294 transitions. [2024-09-13 05:15:28,340 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 294 transitions. Word has length 73 [2024-09-13 05:15:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:28,340 INFO L474 AbstractCegarLoop]: Abstraction has 251 states and 294 transitions. [2024-09-13 05:15:28,340 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 05:15:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 294 transitions. [2024-09-13 05:15:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-09-13 05:15:28,341 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:28,341 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 05:15:28,341 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-09-13 05:15:28,341 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 05:15:28,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:28,341 INFO L85 PathProgramCache]: Analyzing trace with hash 492504784, now seen corresponding path program 1 times [2024-09-13 05:15:28,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:28,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033377930] [2024-09-13 05:15:28,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:28,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 05:15:28,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:28,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033377930] [2024-09-13 05:15:28,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033377930] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:28,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:28,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:28,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021389464] [2024-09-13 05:15:28,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:28,444 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:28,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:28,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:28,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:28,445 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 05:15:28,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:28,774 INFO L93 Difference]: Finished difference Result 274 states and 340 transitions. [2024-09-13 05:15:28,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:28,775 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 05:15:28,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:28,776 INFO L225 Difference]: With dead ends: 274 [2024-09-13 05:15:28,776 INFO L226 Difference]: Without dead ends: 274 [2024-09-13 05:15:28,776 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 05:15:28,776 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 68 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:28,777 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.3s Time] [2024-09-13 05:15:28,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-09-13 05:15:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 250. [2024-09-13 05:15:28,780 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 05:15:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 292 transitions. [2024-09-13 05:15:28,780 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 292 transitions. Word has length 76 [2024-09-13 05:15:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:28,781 INFO L474 AbstractCegarLoop]: Abstraction has 250 states and 292 transitions. [2024-09-13 05:15:28,781 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 05:15:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 292 transitions. [2024-09-13 05:15:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-09-13 05:15:28,781 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:28,782 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 05:15:28,782 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-09-13 05:15:28,782 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 05:15:28,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash 602020942, now seen corresponding path program 1 times [2024-09-13 05:15:28,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:28,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623997437] [2024-09-13 05:15:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:28,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:28,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623997437] [2024-09-13 05:15:28,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623997437] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:28,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:28,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:28,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563414215] [2024-09-13 05:15:28,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:28,883 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:28,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:28,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:28,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:28,884 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 05:15:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:29,257 INFO L93 Difference]: Finished difference Result 272 states and 336 transitions. [2024-09-13 05:15:29,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:29,257 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 05:15:29,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:29,258 INFO L225 Difference]: With dead ends: 272 [2024-09-13 05:15:29,258 INFO L226 Difference]: Without dead ends: 272 [2024-09-13 05:15:29,258 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 05:15:29,258 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 64 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:29,259 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.4s Time] [2024-09-13 05:15:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-09-13 05:15:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 249. [2024-09-13 05:15:29,263 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 05:15:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 290 transitions. [2024-09-13 05:15:29,263 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 290 transitions. Word has length 79 [2024-09-13 05:15:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:29,264 INFO L474 AbstractCegarLoop]: Abstraction has 249 states and 290 transitions. [2024-09-13 05:15:29,264 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 05:15:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 290 transitions. [2024-09-13 05:15:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-13 05:15:29,264 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:29,264 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 05:15:29,264 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-09-13 05:15:29,265 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 05:15:29,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:29,265 INFO L85 PathProgramCache]: Analyzing trace with hash -977251132, now seen corresponding path program 1 times [2024-09-13 05:15:29,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:29,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931508838] [2024-09-13 05:15:29,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:29,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:29,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:29,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:29,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931508838] [2024-09-13 05:15:29,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931508838] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:29,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:29,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:29,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586230019] [2024-09-13 05:15:29,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:29,357 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:29,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:29,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:29,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:29,358 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 05:15:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:29,650 INFO L93 Difference]: Finished difference Result 270 states and 332 transitions. [2024-09-13 05:15:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:29,650 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 05:15:29,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:29,651 INFO L225 Difference]: With dead ends: 270 [2024-09-13 05:15:29,651 INFO L226 Difference]: Without dead ends: 270 [2024-09-13 05:15:29,651 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 05:15:29,652 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:29,652 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.3s Time] [2024-09-13 05:15:29,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-09-13 05:15:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 248. [2024-09-13 05:15:29,655 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 05:15:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 288 transitions. [2024-09-13 05:15:29,656 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 288 transitions. Word has length 82 [2024-09-13 05:15:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:29,656 INFO L474 AbstractCegarLoop]: Abstraction has 248 states and 288 transitions. [2024-09-13 05:15:29,656 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 05:15:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 288 transitions. [2024-09-13 05:15:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-13 05:15:29,657 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:29,657 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 05:15:29,657 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-09-13 05:15:29,657 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 05:15:29,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:29,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1999837374, now seen corresponding path program 1 times [2024-09-13 05:15:29,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:29,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696570682] [2024-09-13 05:15:29,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:29,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:29,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:29,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696570682] [2024-09-13 05:15:29,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696570682] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:29,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:29,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:29,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147645370] [2024-09-13 05:15:29,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:29,750 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:29,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:29,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:29,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:29,751 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 05:15:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:30,100 INFO L93 Difference]: Finished difference Result 268 states and 328 transitions. [2024-09-13 05:15:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:30,100 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 05:15:30,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:30,101 INFO L225 Difference]: With dead ends: 268 [2024-09-13 05:15:30,101 INFO L226 Difference]: Without dead ends: 268 [2024-09-13 05:15:30,101 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 05:15:30,101 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 61 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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 05:15:30,102 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 05:15:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-09-13 05:15:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 247. [2024-09-13 05:15:30,104 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 05:15:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 286 transitions. [2024-09-13 05:15:30,104 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 286 transitions. Word has length 85 [2024-09-13 05:15:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:30,104 INFO L474 AbstractCegarLoop]: Abstraction has 247 states and 286 transitions. [2024-09-13 05:15:30,104 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 05:15:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 286 transitions. [2024-09-13 05:15:30,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-09-13 05:15:30,105 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:30,105 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 05:15:30,105 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-09-13 05:15:30,105 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 05:15:30,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:30,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1663532360, now seen corresponding path program 1 times [2024-09-13 05:15:30,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:30,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197298788] [2024-09-13 05:15:30,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:30,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:30,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197298788] [2024-09-13 05:15:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197298788] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:30,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:30,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:30,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948955983] [2024-09-13 05:15:30,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:30,214 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:30,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:30,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:30,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:30,215 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 05:15:30,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:30,550 INFO L93 Difference]: Finished difference Result 266 states and 324 transitions. [2024-09-13 05:15:30,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:30,550 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 05:15:30,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:30,551 INFO L225 Difference]: With dead ends: 266 [2024-09-13 05:15:30,551 INFO L226 Difference]: Without dead ends: 266 [2024-09-13 05:15:30,551 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 05:15:30,552 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 59 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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 05:15:30,552 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 05:15:30,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-09-13 05:15:30,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 246. [2024-09-13 05:15:30,555 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 05:15:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 284 transitions. [2024-09-13 05:15:30,555 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 284 transitions. Word has length 88 [2024-09-13 05:15:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:30,556 INFO L474 AbstractCegarLoop]: Abstraction has 246 states and 284 transitions. [2024-09-13 05:15:30,556 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 05:15:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 284 transitions. [2024-09-13 05:15:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-09-13 05:15:30,557 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:30,557 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 05:15:30,557 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-09-13 05:15:30,557 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 05:15:30,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:30,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1335415350, now seen corresponding path program 1 times [2024-09-13 05:15:30,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:30,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816833334] [2024-09-13 05:15:30,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:30,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:30,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:30,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816833334] [2024-09-13 05:15:30,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816833334] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:30,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:30,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:30,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789494907] [2024-09-13 05:15:30,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:30,659 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:30,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:30,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:30,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:30,660 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 05:15:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:31,008 INFO L93 Difference]: Finished difference Result 264 states and 320 transitions. [2024-09-13 05:15:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:31,008 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 05:15:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:31,009 INFO L225 Difference]: With dead ends: 264 [2024-09-13 05:15:31,009 INFO L226 Difference]: Without dead ends: 264 [2024-09-13 05:15:31,010 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 05:15:31,010 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 56 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:31,010 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.3s Time] [2024-09-13 05:15:31,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-09-13 05:15:31,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 245. [2024-09-13 05:15:31,013 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 05:15:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 282 transitions. [2024-09-13 05:15:31,014 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 282 transitions. Word has length 91 [2024-09-13 05:15:31,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:31,014 INFO L474 AbstractCegarLoop]: Abstraction has 245 states and 282 transitions. [2024-09-13 05:15:31,014 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 05:15:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 282 transitions. [2024-09-13 05:15:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-09-13 05:15:31,015 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:31,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] [2024-09-13 05:15:31,015 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-09-13 05:15:31,015 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 05:15:31,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash -923037524, now seen corresponding path program 1 times [2024-09-13 05:15:31,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:31,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283287165] [2024-09-13 05:15:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:31,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:31,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:31,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283287165] [2024-09-13 05:15:31,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283287165] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:31,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:31,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:31,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113686263] [2024-09-13 05:15:31,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:31,115 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:31,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:31,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:31,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:31,115 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 05:15:31,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:31,580 INFO L93 Difference]: Finished difference Result 262 states and 316 transitions. [2024-09-13 05:15:31,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:31,580 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 05:15:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:31,581 INFO L225 Difference]: With dead ends: 262 [2024-09-13 05:15:31,582 INFO L226 Difference]: Without dead ends: 262 [2024-09-13 05:15:31,582 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 05:15:31,582 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 52 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:31,582 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.5s Time] [2024-09-13 05:15:31,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-09-13 05:15:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 244. [2024-09-13 05:15:31,587 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 05:15:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 280 transitions. [2024-09-13 05:15:31,587 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 280 transitions. Word has length 94 [2024-09-13 05:15:31,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:31,588 INFO L474 AbstractCegarLoop]: Abstraction has 244 states and 280 transitions. [2024-09-13 05:15:31,588 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 05:15:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 280 transitions. [2024-09-13 05:15:31,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-09-13 05:15:31,589 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:31,589 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 05:15:31,589 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-09-13 05:15:31,589 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 05:15:31,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:31,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1829905110, now seen corresponding path program 1 times [2024-09-13 05:15:31,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:31,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444933195] [2024-09-13 05:15:31,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:31,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:31,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444933195] [2024-09-13 05:15:31,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444933195] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:31,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:31,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:31,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487429981] [2024-09-13 05:15:31,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:31,697 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:31,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:31,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:31,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:31,698 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 05:15:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:31,974 INFO L93 Difference]: Finished difference Result 260 states and 312 transitions. [2024-09-13 05:15:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:31,975 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 05:15:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:31,975 INFO L225 Difference]: With dead ends: 260 [2024-09-13 05:15:31,975 INFO L226 Difference]: Without dead ends: 260 [2024-09-13 05:15:31,976 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 05:15:31,976 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 05:15:31,976 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 05:15:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-09-13 05:15:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 243. [2024-09-13 05:15:31,979 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 05:15:31,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 278 transitions. [2024-09-13 05:15:31,979 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 278 transitions. Word has length 97 [2024-09-13 05:15:31,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:31,980 INFO L474 AbstractCegarLoop]: Abstraction has 243 states and 278 transitions. [2024-09-13 05:15:31,980 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 05:15:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 278 transitions. [2024-09-13 05:15:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-09-13 05:15:31,981 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:31,981 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 05:15:31,981 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-09-13 05:15:31,981 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 05:15:31,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:31,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1317109408, now seen corresponding path program 1 times [2024-09-13 05:15:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:31,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326566599] [2024-09-13 05:15:31,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:32,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:32,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326566599] [2024-09-13 05:15:32,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326566599] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:32,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:32,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:32,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726340397] [2024-09-13 05:15:32,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:32,091 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:32,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:32,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:32,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:32,091 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 05:15:32,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:32,422 INFO L93 Difference]: Finished difference Result 258 states and 308 transitions. [2024-09-13 05:15:32,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:32,422 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 05:15:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:32,423 INFO L225 Difference]: With dead ends: 258 [2024-09-13 05:15:32,423 INFO L226 Difference]: Without dead ends: 258 [2024-09-13 05:15:32,424 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 05:15:32,424 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 46 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:32,424 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.3s Time] [2024-09-13 05:15:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-09-13 05:15:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 242. [2024-09-13 05:15:32,427 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 05:15:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 276 transitions. [2024-09-13 05:15:32,427 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 276 transitions. Word has length 100 [2024-09-13 05:15:32,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:32,428 INFO L474 AbstractCegarLoop]: Abstraction has 242 states and 276 transitions. [2024-09-13 05:15:32,428 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 05:15:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 276 transitions. [2024-09-13 05:15:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-09-13 05:15:32,429 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:32,429 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 05:15:32,429 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-09-13 05:15:32,429 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 05:15:32,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:32,429 INFO L85 PathProgramCache]: Analyzing trace with hash -814479328, now seen corresponding path program 1 times [2024-09-13 05:15:32,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:32,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112905320] [2024-09-13 05:15:32,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:32,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:32,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:32,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112905320] [2024-09-13 05:15:32,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112905320] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:32,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:32,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:32,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472022330] [2024-09-13 05:15:32,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:32,521 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:32,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:32,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:32,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:32,522 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 05:15:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:32,791 INFO L93 Difference]: Finished difference Result 256 states and 304 transitions. [2024-09-13 05:15:32,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:32,791 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 05:15:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:32,792 INFO L225 Difference]: With dead ends: 256 [2024-09-13 05:15:32,792 INFO L226 Difference]: Without dead ends: 256 [2024-09-13 05:15:32,792 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 05:15:32,793 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:32,793 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.3s Time] [2024-09-13 05:15:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-09-13 05:15:32,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 241. [2024-09-13 05:15:32,795 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 05:15:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 274 transitions. [2024-09-13 05:15:32,796 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 274 transitions. Word has length 103 [2024-09-13 05:15:32,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:32,796 INFO L474 AbstractCegarLoop]: Abstraction has 241 states and 274 transitions. [2024-09-13 05:15:32,796 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 05:15:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 274 transitions. [2024-09-13 05:15:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-09-13 05:15:32,796 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:32,797 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 05:15:32,797 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-09-13 05:15:32,797 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 05:15:32,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1883032238, now seen corresponding path program 1 times [2024-09-13 05:15:32,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:32,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072858808] [2024-09-13 05:15:32,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:32,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:32,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:32,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072858808] [2024-09-13 05:15:32,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072858808] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:32,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:32,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:32,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890331684] [2024-09-13 05:15:32,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:32,894 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:32,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:32,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:32,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:32,895 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 05:15:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:33,227 INFO L93 Difference]: Finished difference Result 254 states and 300 transitions. [2024-09-13 05:15:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:33,228 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 05:15:33,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:33,229 INFO L225 Difference]: With dead ends: 254 [2024-09-13 05:15:33,229 INFO L226 Difference]: Without dead ends: 254 [2024-09-13 05:15:33,229 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 05:15:33,230 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 44 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:33,230 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.3s Time] [2024-09-13 05:15:33,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-09-13 05:15:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2024-09-13 05:15:33,233 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 05:15:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 272 transitions. [2024-09-13 05:15:33,233 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 272 transitions. Word has length 106 [2024-09-13 05:15:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:33,234 INFO L474 AbstractCegarLoop]: Abstraction has 240 states and 272 transitions. [2024-09-13 05:15:33,234 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 05:15:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 272 transitions. [2024-09-13 05:15:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-09-13 05:15:33,234 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:33,235 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 05:15:33,235 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-09-13 05:15:33,235 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 05:15:33,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:33,235 INFO L85 PathProgramCache]: Analyzing trace with hash -845166188, now seen corresponding path program 1 times [2024-09-13 05:15:33,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:33,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567934120] [2024-09-13 05:15:33,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:33,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:33,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:33,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567934120] [2024-09-13 05:15:33,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567934120] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:33,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:33,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:33,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182353619] [2024-09-13 05:15:33,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:33,335 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:33,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:33,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:33,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:33,335 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 05:15:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:33,712 INFO L93 Difference]: Finished difference Result 252 states and 296 transitions. [2024-09-13 05:15:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:33,713 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 05:15:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:33,713 INFO L225 Difference]: With dead ends: 252 [2024-09-13 05:15:33,713 INFO L226 Difference]: Without dead ends: 252 [2024-09-13 05:15:33,714 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 05:15:33,714 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:33,714 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.4s Time] [2024-09-13 05:15:33,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-09-13 05:15:33,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 239. [2024-09-13 05:15:33,716 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 05:15:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 270 transitions. [2024-09-13 05:15:33,717 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 270 transitions. Word has length 109 [2024-09-13 05:15:33,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:33,717 INFO L474 AbstractCegarLoop]: Abstraction has 239 states and 270 transitions. [2024-09-13 05:15:33,717 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 05:15:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 270 transitions. [2024-09-13 05:15:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-09-13 05:15:33,717 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:33,718 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 05:15:33,718 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-09-13 05:15:33,718 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 05:15:33,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:33,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1247224500, now seen corresponding path program 1 times [2024-09-13 05:15:33,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:33,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525775017] [2024-09-13 05:15:33,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:33,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:33,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:33,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525775017] [2024-09-13 05:15:33,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525775017] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:33,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:33,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:33,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053559489] [2024-09-13 05:15:33,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:33,817 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:33,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:33,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:33,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:33,818 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 05:15:34,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:34,124 INFO L93 Difference]: Finished difference Result 250 states and 292 transitions. [2024-09-13 05:15:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:34,125 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 05:15:34,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:34,125 INFO L225 Difference]: With dead ends: 250 [2024-09-13 05:15:34,125 INFO L226 Difference]: Without dead ends: 250 [2024-09-13 05:15:34,126 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 05:15:34,126 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:34,126 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.3s Time] [2024-09-13 05:15:34,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-09-13 05:15:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2024-09-13 05:15:34,128 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 05:15:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 268 transitions. [2024-09-13 05:15:34,128 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 268 transitions. Word has length 112 [2024-09-13 05:15:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:34,128 INFO L474 AbstractCegarLoop]: Abstraction has 238 states and 268 transitions. [2024-09-13 05:15:34,129 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 05:15:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 268 transitions. [2024-09-13 05:15:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-13 05:15:34,129 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:34,129 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 05:15:34,129 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-09-13 05:15:34,129 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 05:15:34,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:34,129 INFO L85 PathProgramCache]: Analyzing trace with hash -302598840, now seen corresponding path program 1 times [2024-09-13 05:15:34,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:34,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239575723] [2024-09-13 05:15:34,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:34,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:34,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:34,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239575723] [2024-09-13 05:15:34,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239575723] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:34,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:34,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:34,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464732314] [2024-09-13 05:15:34,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:34,244 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:34,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:34,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:34,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:34,245 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 05:15:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:34,559 INFO L93 Difference]: Finished difference Result 248 states and 288 transitions. [2024-09-13 05:15:34,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:34,559 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 05:15:34,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:34,560 INFO L225 Difference]: With dead ends: 248 [2024-09-13 05:15:34,560 INFO L226 Difference]: Without dead ends: 248 [2024-09-13 05:15:34,561 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 05:15:34,561 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:34,561 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.3s Time] [2024-09-13 05:15:34,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-09-13 05:15:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 237. [2024-09-13 05:15:34,564 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 05:15:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 266 transitions. [2024-09-13 05:15:34,564 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 266 transitions. Word has length 115 [2024-09-13 05:15:34,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:34,564 INFO L474 AbstractCegarLoop]: Abstraction has 237 states and 266 transitions. [2024-09-13 05:15:34,564 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 05:15:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 266 transitions. [2024-09-13 05:15:34,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-09-13 05:15:34,565 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:34,565 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 05:15:34,565 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-09-13 05:15:34,565 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 05:15:34,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:34,566 INFO L85 PathProgramCache]: Analyzing trace with hash 414724736, now seen corresponding path program 1 times [2024-09-13 05:15:34,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:34,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501701480] [2024-09-13 05:15:34,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:34,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:34,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 05:15:34,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:34,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501701480] [2024-09-13 05:15:34,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501701480] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:34,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:34,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:34,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355377706] [2024-09-13 05:15:34,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:34,676 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:34,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:34,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:34,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:34,677 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 05:15:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:34,955 INFO L93 Difference]: Finished difference Result 246 states and 284 transitions. [2024-09-13 05:15:34,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:34,956 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 05:15:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:34,957 INFO L225 Difference]: With dead ends: 246 [2024-09-13 05:15:34,957 INFO L226 Difference]: Without dead ends: 246 [2024-09-13 05:15:34,957 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 05:15:34,957 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:34,957 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.3s Time] [2024-09-13 05:15:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-09-13 05:15:34,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 236. [2024-09-13 05:15:34,960 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 05:15:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 264 transitions. [2024-09-13 05:15:34,960 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 264 transitions. Word has length 118 [2024-09-13 05:15:34,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:34,960 INFO L474 AbstractCegarLoop]: Abstraction has 236 states and 264 transitions. [2024-09-13 05:15:34,960 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 05:15:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 264 transitions. [2024-09-13 05:15:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-09-13 05:15:34,961 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:34,961 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 05:15:34,961 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-09-13 05:15:34,961 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 05:15:34,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:34,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1555877636, now seen corresponding path program 1 times [2024-09-13 05:15:34,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:34,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174004861] [2024-09-13 05:15:34,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:34,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:35,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 05:15:35,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:35,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174004861] [2024-09-13 05:15:35,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174004861] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:35,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:35,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:35,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407468333] [2024-09-13 05:15:35,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:35,069 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:35,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:35,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:35,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:35,069 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 05:15:35,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:35,355 INFO L93 Difference]: Finished difference Result 244 states and 280 transitions. [2024-09-13 05:15:35,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:35,356 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 05:15:35,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:35,357 INFO L225 Difference]: With dead ends: 244 [2024-09-13 05:15:35,357 INFO L226 Difference]: Without dead ends: 244 [2024-09-13 05:15:35,357 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 05:15:35,357 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:35,357 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.3s Time] [2024-09-13 05:15:35,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-09-13 05:15:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 235. [2024-09-13 05:15:35,359 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 05:15:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 262 transitions. [2024-09-13 05:15:35,360 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 262 transitions. Word has length 121 [2024-09-13 05:15:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:35,360 INFO L474 AbstractCegarLoop]: Abstraction has 235 states and 262 transitions. [2024-09-13 05:15:35,360 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 05:15:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 262 transitions. [2024-09-13 05:15:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-09-13 05:15:35,361 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:35,361 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 05:15:35,361 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-09-13 05:15:35,361 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 05:15:35,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:35,361 INFO L85 PathProgramCache]: Analyzing trace with hash 136837044, now seen corresponding path program 1 times [2024-09-13 05:15:35,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:35,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36705717] [2024-09-13 05:15:35,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:35,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:35,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:35,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:35,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36705717] [2024-09-13 05:15:35,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36705717] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:35,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:35,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:35,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473166458] [2024-09-13 05:15:35,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:35,473 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:35,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:35,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:35,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:35,474 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 05:15:35,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:35,708 INFO L93 Difference]: Finished difference Result 242 states and 276 transitions. [2024-09-13 05:15:35,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:35,708 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 05:15:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:35,709 INFO L225 Difference]: With dead ends: 242 [2024-09-13 05:15:35,709 INFO L226 Difference]: Without dead ends: 242 [2024-09-13 05:15:35,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 05:15:35,710 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 05:15:35,710 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 05:15:35,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-09-13 05:15:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 234. [2024-09-13 05:15:35,712 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 05:15:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 260 transitions. [2024-09-13 05:15:35,713 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 260 transitions. Word has length 124 [2024-09-13 05:15:35,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:35,713 INFO L474 AbstractCegarLoop]: Abstraction has 234 states and 260 transitions. [2024-09-13 05:15:35,713 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 05:15:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 260 transitions. [2024-09-13 05:15:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-09-13 05:15:35,714 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:35,714 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-09-13 05:15:35,714 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 05:15:35,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:35,714 INFO L85 PathProgramCache]: Analyzing trace with hash 588856496, now seen corresponding path program 1 times [2024-09-13 05:15:35,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:35,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188423969] [2024-09-13 05:15:35,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:35,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:35,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 05:15:35,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:35,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188423969] [2024-09-13 05:15:35,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188423969] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:35,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:35,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:35,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107021914] [2024-09-13 05:15:35,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:35,825 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:35,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:35,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:35,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:35,826 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 05:15:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:36,091 INFO L93 Difference]: Finished difference Result 240 states and 272 transitions. [2024-09-13 05:15:36,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:36,092 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 05:15:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:36,092 INFO L225 Difference]: With dead ends: 240 [2024-09-13 05:15:36,092 INFO L226 Difference]: Without dead ends: 240 [2024-09-13 05:15:36,092 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 05:15:36,093 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:36,093 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.3s Time] [2024-09-13 05:15:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-09-13 05:15:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 233. [2024-09-13 05:15:36,095 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 05:15:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 258 transitions. [2024-09-13 05:15:36,095 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 258 transitions. Word has length 127 [2024-09-13 05:15:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:36,095 INFO L474 AbstractCegarLoop]: Abstraction has 233 states and 258 transitions. [2024-09-13 05:15:36,096 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 05:15:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 258 transitions. [2024-09-13 05:15:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-09-13 05:15:36,096 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:36,096 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 05:15:36,096 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-09-13 05:15:36,096 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 05:15:36,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1977887976, now seen corresponding path program 1 times [2024-09-13 05:15:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:36,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131477093] [2024-09-13 05:15:36,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:36,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:36,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131477093] [2024-09-13 05:15:36,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131477093] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:36,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:36,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:36,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830682289] [2024-09-13 05:15:36,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:36,207 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:36,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:36,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:36,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:36,208 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 05:15:36,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:36,429 INFO L93 Difference]: Finished difference Result 238 states and 268 transitions. [2024-09-13 05:15:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:36,429 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 05:15:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:36,430 INFO L225 Difference]: With dead ends: 238 [2024-09-13 05:15:36,430 INFO L226 Difference]: Without dead ends: 238 [2024-09-13 05:15:36,430 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 05:15:36,430 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 05:15:36,431 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 05:15:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-09-13 05:15:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 232. [2024-09-13 05:15:36,433 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 05:15:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 256 transitions. [2024-09-13 05:15:36,433 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 256 transitions. Word has length 130 [2024-09-13 05:15:36,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:36,434 INFO L474 AbstractCegarLoop]: Abstraction has 232 states and 256 transitions. [2024-09-13 05:15:36,434 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 05:15:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 256 transitions. [2024-09-13 05:15:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-09-13 05:15:36,434 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:36,435 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 05:15:36,435 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-09-13 05:15:36,435 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 05:15:36,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:36,435 INFO L85 PathProgramCache]: Analyzing trace with hash 604821604, now seen corresponding path program 1 times [2024-09-13 05:15:36,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:36,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143383259] [2024-09-13 05:15:36,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:36,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143383259] [2024-09-13 05:15:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143383259] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:36,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:36,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:36,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736957134] [2024-09-13 05:15:36,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:36,547 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:36,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:36,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:36,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:36,548 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 05:15:36,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:36,843 INFO L93 Difference]: Finished difference Result 236 states and 264 transitions. [2024-09-13 05:15:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:36,844 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 05:15:36,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:36,844 INFO L225 Difference]: With dead ends: 236 [2024-09-13 05:15:36,844 INFO L226 Difference]: Without dead ends: 236 [2024-09-13 05:15:36,844 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 05:15:36,845 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:36,845 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.3s Time] [2024-09-13 05:15:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-09-13 05:15:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 231. [2024-09-13 05:15:36,847 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 05:15:36,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 254 transitions. [2024-09-13 05:15:36,848 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 254 transitions. Word has length 133 [2024-09-13 05:15:36,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:36,848 INFO L474 AbstractCegarLoop]: Abstraction has 231 states and 254 transitions. [2024-09-13 05:15:36,848 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 05:15:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 254 transitions. [2024-09-13 05:15:36,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-09-13 05:15:36,849 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:36,849 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:36,849 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-09-13 05:15:36,849 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 05:15:36,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:36,849 INFO L85 PathProgramCache]: Analyzing trace with hash 853070366, now seen corresponding path program 1 times [2024-09-13 05:15:36,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:36,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959052420] [2024-09-13 05:15:36,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:36,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:36,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:36,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959052420] [2024-09-13 05:15:36,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959052420] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:36,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:36,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:36,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785323969] [2024-09-13 05:15:36,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:36,976 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:36,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:36,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:36,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:36,977 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 05:15:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:37,273 INFO L93 Difference]: Finished difference Result 234 states and 260 transitions. [2024-09-13 05:15:37,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:37,273 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 05:15:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:37,274 INFO L225 Difference]: With dead ends: 234 [2024-09-13 05:15:37,274 INFO L226 Difference]: Without dead ends: 234 [2024-09-13 05:15:37,274 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 05:15:37,274 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:37,274 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.3s Time] [2024-09-13 05:15:37,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-09-13 05:15:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2024-09-13 05:15:37,277 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 05:15:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2024-09-13 05:15:37,277 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 136 [2024-09-13 05:15:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:37,277 INFO L474 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2024-09-13 05:15:37,277 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 05:15:37,278 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2024-09-13 05:15:37,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-09-13 05:15:37,278 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:37,278 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 05:15:37,278 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-09-13 05:15:37,279 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 05:15:37,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:37,279 INFO L85 PathProgramCache]: Analyzing trace with hash 498265302, now seen corresponding path program 1 times [2024-09-13 05:15:37,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:37,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691899251] [2024-09-13 05:15:37,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:37,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:37,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:37,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:37,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691899251] [2024-09-13 05:15:37,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691899251] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:37,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:37,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:37,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788814885] [2024-09-13 05:15:37,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:37,409 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:37,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:37,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:37,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:37,410 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 05:15:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:37,640 INFO L93 Difference]: Finished difference Result 232 states and 256 transitions. [2024-09-13 05:15:37,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:37,641 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 05:15:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:37,641 INFO L225 Difference]: With dead ends: 232 [2024-09-13 05:15:37,642 INFO L226 Difference]: Without dead ends: 232 [2024-09-13 05:15:37,642 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 05:15:37,642 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 16 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 05:15:37,642 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 05:15:37,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-09-13 05:15:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2024-09-13 05:15:37,644 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 05:15:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 250 transitions. [2024-09-13 05:15:37,644 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 250 transitions. Word has length 139 [2024-09-13 05:15:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:37,645 INFO L474 AbstractCegarLoop]: Abstraction has 229 states and 250 transitions. [2024-09-13 05:15:37,645 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 05:15:37,645 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 250 transitions. [2024-09-13 05:15:37,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-09-13 05:15:37,645 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:37,645 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 05:15:37,645 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-09-13 05:15:37,645 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 05:15:37,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:37,646 INFO L85 PathProgramCache]: Analyzing trace with hash 415129042, now seen corresponding path program 1 times [2024-09-13 05:15:37,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:37,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097608016] [2024-09-13 05:15:37,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:37,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:37,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:37,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097608016] [2024-09-13 05:15:37,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097608016] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:37,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:37,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:37,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449523679] [2024-09-13 05:15:37,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:37,759 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:37,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:37,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:37,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:37,766 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 05:15:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:38,052 INFO L93 Difference]: Finished difference Result 230 states and 252 transitions. [2024-09-13 05:15:38,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:38,053 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 05:15:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:38,054 INFO L225 Difference]: With dead ends: 230 [2024-09-13 05:15:38,054 INFO L226 Difference]: Without dead ends: 230 [2024-09-13 05:15:38,054 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 05:15:38,054 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:38,054 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.3s Time] [2024-09-13 05:15:38,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-09-13 05:15:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2024-09-13 05:15:38,057 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 05:15:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2024-09-13 05:15:38,057 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 142 [2024-09-13 05:15:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:38,057 INFO L474 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2024-09-13 05:15:38,057 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 05:15:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2024-09-13 05:15:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-09-13 05:15:38,058 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:38,058 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 05:15:38,058 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-09-13 05:15:38,058 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 05:15:38,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1898947216, now seen corresponding path program 1 times [2024-09-13 05:15:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:38,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343496236] [2024-09-13 05:15:38,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:38,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:38,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:38,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343496236] [2024-09-13 05:15:38,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343496236] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:38,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:38,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:38,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089225644] [2024-09-13 05:15:38,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:38,175 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:38,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:38,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:38,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:38,176 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 05:15:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:38,461 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2024-09-13 05:15:38,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:38,461 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 05:15:38,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:38,462 INFO L225 Difference]: With dead ends: 228 [2024-09-13 05:15:38,462 INFO L226 Difference]: Without dead ends: 228 [2024-09-13 05:15:38,462 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 05:15:38,463 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 05:15:38,463 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 05:15:38,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-09-13 05:15:38,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2024-09-13 05:15:38,465 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 05:15:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 246 transitions. [2024-09-13 05:15:38,465 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 246 transitions. Word has length 145 [2024-09-13 05:15:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:38,466 INFO L474 AbstractCegarLoop]: Abstraction has 227 states and 246 transitions. [2024-09-13 05:15:38,466 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 05:15:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 246 transitions. [2024-09-13 05:15:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-09-13 05:15:38,466 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:38,466 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 05:15:38,467 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-09-13 05:15:38,467 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 05:15:38,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:38,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1772198970, now seen corresponding path program 1 times [2024-09-13 05:15:38,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:38,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590936179] [2024-09-13 05:15:38,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:38,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:38,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:38,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590936179] [2024-09-13 05:15:38,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590936179] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:38,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:38,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:38,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010527988] [2024-09-13 05:15:38,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:38,606 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:38,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:38,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:38,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:38,606 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 05:15:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:38,870 INFO L93 Difference]: Finished difference Result 226 states and 244 transitions. [2024-09-13 05:15:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:38,870 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 05:15:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:38,871 INFO L225 Difference]: With dead ends: 226 [2024-09-13 05:15:38,871 INFO L226 Difference]: Without dead ends: 226 [2024-09-13 05:15:38,871 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 05:15:38,871 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 8 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:38,871 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.3s Time] [2024-09-13 05:15:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-09-13 05:15:38,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-09-13 05:15:38,873 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 05:15:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 244 transitions. [2024-09-13 05:15:38,873 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 244 transitions. Word has length 148 [2024-09-13 05:15:38,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:38,874 INFO L474 AbstractCegarLoop]: Abstraction has 226 states and 244 transitions. [2024-09-13 05:15:38,874 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 05:15:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 244 transitions. [2024-09-13 05:15:38,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-09-13 05:15:38,874 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:38,874 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 05:15:38,874 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-09-13 05:15:38,874 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 05:15:38,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:38,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1840990844, now seen corresponding path program 1 times [2024-09-13 05:15:38,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:38,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025669822] [2024-09-13 05:15:38,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:38,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:38,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:38,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025669822] [2024-09-13 05:15:38,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025669822] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:38,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:38,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:38,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827126040] [2024-09-13 05:15:38,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:38,997 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:38,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:38,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:38,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:38,998 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 05:15:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:39,223 INFO L93 Difference]: Finished difference Result 224 states and 241 transitions. [2024-09-13 05:15:39,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:39,224 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 05:15:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:39,224 INFO L225 Difference]: With dead ends: 224 [2024-09-13 05:15:39,224 INFO L226 Difference]: Without dead ends: 224 [2024-09-13 05:15:39,224 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 05:15:39,225 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 05:15:39,225 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 05:15:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-09-13 05:15:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-09-13 05:15:39,226 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 05:15:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 241 transitions. [2024-09-13 05:15:39,227 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 241 transitions. Word has length 151 [2024-09-13 05:15:39,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:39,227 INFO L474 AbstractCegarLoop]: Abstraction has 224 states and 241 transitions. [2024-09-13 05:15:39,227 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 05:15:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 241 transitions. [2024-09-13 05:15:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-09-13 05:15:39,227 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:39,227 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 05:15:39,227 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-09-13 05:15:39,228 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 05:15:39,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1774675906, now seen corresponding path program 1 times [2024-09-13 05:15:39,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:39,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944578576] [2024-09-13 05:15:39,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:39,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:39,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:39,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944578576] [2024-09-13 05:15:39,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944578576] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:39,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:39,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:39,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158458794] [2024-09-13 05:15:39,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:39,391 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:39,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:39,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:39,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:39,392 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 05:15:39,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:39,625 INFO L93 Difference]: Finished difference Result 223 states and 239 transitions. [2024-09-13 05:15:39,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:39,625 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 05:15:39,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:39,626 INFO L225 Difference]: With dead ends: 223 [2024-09-13 05:15:39,626 INFO L226 Difference]: Without dead ends: 223 [2024-09-13 05:15:39,626 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 05:15:39,626 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 05:15:39,626 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 05:15:39,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-09-13 05:15:39,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-09-13 05:15:39,628 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 05:15:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 239 transitions. [2024-09-13 05:15:39,629 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 239 transitions. Word has length 154 [2024-09-13 05:15:39,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:39,629 INFO L474 AbstractCegarLoop]: Abstraction has 223 states and 239 transitions. [2024-09-13 05:15:39,629 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 05:15:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 239 transitions. [2024-09-13 05:15:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-09-13 05:15:39,629 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:39,630 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-09-13 05:15:39,630 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 05:15:39,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:39,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1676949050, now seen corresponding path program 1 times [2024-09-13 05:15:39,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:39,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123745270] [2024-09-13 05:15:39,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:39,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:39,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:39,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123745270] [2024-09-13 05:15:39,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123745270] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:39,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:39,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:39,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776597508] [2024-09-13 05:15:39,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:39,798 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:39,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:39,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:39,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:39,798 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 05:15:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:40,143 INFO L93 Difference]: Finished difference Result 222 states and 237 transitions. [2024-09-13 05:15:40,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:40,144 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 05:15:40,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:40,145 INFO L225 Difference]: With dead ends: 222 [2024-09-13 05:15:40,145 INFO L226 Difference]: Without dead ends: 222 [2024-09-13 05:15:40,145 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 05:15:40,145 INFO L434 NwaCegarLoop]: 150 mSDtfsCounter, 66 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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 05:15:40,146 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 05:15:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-09-13 05:15:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2024-09-13 05:15:40,148 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 05:15:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 237 transitions. [2024-09-13 05:15:40,149 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 237 transitions. Word has length 157 [2024-09-13 05:15:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:40,149 INFO L474 AbstractCegarLoop]: Abstraction has 222 states and 237 transitions. [2024-09-13 05:15:40,149 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 05:15:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 237 transitions. [2024-09-13 05:15:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-09-13 05:15:40,150 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:40,150 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 05:15:40,150 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-09-13 05:15:40,151 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 05:15:40,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:40,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997060, now seen corresponding path program 1 times [2024-09-13 05:15:40,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:40,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269880907] [2024-09-13 05:15:40,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:40,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:40,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 05:15:40,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:40,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269880907] [2024-09-13 05:15:40,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269880907] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:40,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:40,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:40,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122321782] [2024-09-13 05:15:40,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:40,298 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:40,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:40,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:40,299 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 05:15:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:40,584 INFO L93 Difference]: Finished difference Result 221 states and 235 transitions. [2024-09-13 05:15:40,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:40,584 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 05:15:40,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:40,585 INFO L225 Difference]: With dead ends: 221 [2024-09-13 05:15:40,585 INFO L226 Difference]: Without dead ends: 221 [2024-09-13 05:15:40,585 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 05:15:40,586 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:40,586 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.3s Time] [2024-09-13 05:15:40,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-09-13 05:15:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-09-13 05:15:40,588 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 05:15:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 235 transitions. [2024-09-13 05:15:40,588 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 235 transitions. Word has length 160 [2024-09-13 05:15:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:40,588 INFO L474 AbstractCegarLoop]: Abstraction has 221 states and 235 transitions. [2024-09-13 05:15:40,588 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 05:15:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 235 transitions. [2024-09-13 05:15:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-09-13 05:15:40,589 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:40,589 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 05:15:40,589 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-09-13 05:15:40,589 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 05:15:40,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:40,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1238059512, now seen corresponding path program 1 times [2024-09-13 05:15:40,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:40,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523543628] [2024-09-13 05:15:40,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:40,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:40,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:40,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523543628] [2024-09-13 05:15:40,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523543628] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:40,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:40,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:40,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615263082] [2024-09-13 05:15:40,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:40,746 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:40,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:40,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:40,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:40,747 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 05:15:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:41,077 INFO L93 Difference]: Finished difference Result 220 states and 233 transitions. [2024-09-13 05:15:41,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:41,078 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 05:15:41,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:41,079 INFO L225 Difference]: With dead ends: 220 [2024-09-13 05:15:41,079 INFO L226 Difference]: Without dead ends: 220 [2024-09-13 05:15:41,079 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 05:15:41,079 INFO L434 NwaCegarLoop]: 148 mSDtfsCounter, 60 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:41,080 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.3s Time] [2024-09-13 05:15:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-09-13 05:15:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-09-13 05:15:41,082 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 05:15:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 233 transitions. [2024-09-13 05:15:41,082 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 233 transitions. Word has length 163 [2024-09-13 05:15:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:41,082 INFO L474 AbstractCegarLoop]: Abstraction has 220 states and 233 transitions. [2024-09-13 05:15:41,082 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 05:15:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 233 transitions. [2024-09-13 05:15:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-09-13 05:15:41,083 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:41,083 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 05:15:41,083 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-09-13 05:15:41,084 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 05:15:41,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:41,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2146173754, now seen corresponding path program 1 times [2024-09-13 05:15:41,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:41,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109842284] [2024-09-13 05:15:41,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:41,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:41,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:41,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109842284] [2024-09-13 05:15:41,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109842284] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:41,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:41,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:41,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134462796] [2024-09-13 05:15:41,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:41,238 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:41,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:41,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:41,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:41,239 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 05:15:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:41,544 INFO L93 Difference]: Finished difference Result 219 states and 231 transitions. [2024-09-13 05:15:41,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:41,544 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 05:15:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:41,545 INFO L225 Difference]: With dead ends: 219 [2024-09-13 05:15:41,545 INFO L226 Difference]: Without dead ends: 219 [2024-09-13 05:15:41,545 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 05:15:41,546 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:41,546 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.3s Time] [2024-09-13 05:15:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-09-13 05:15:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-09-13 05:15:41,548 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 05:15:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 231 transitions. [2024-09-13 05:15:41,550 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 231 transitions. Word has length 166 [2024-09-13 05:15:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:41,550 INFO L474 AbstractCegarLoop]: Abstraction has 219 states and 231 transitions. [2024-09-13 05:15:41,550 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 05:15:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 231 transitions. [2024-09-13 05:15:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-09-13 05:15:41,551 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:41,551 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 05:15:41,551 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-09-13 05:15:41,551 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 05:15:41,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1778550196, now seen corresponding path program 1 times [2024-09-13 05:15:41,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:41,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128090106] [2024-09-13 05:15:41,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:41,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:41,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:41,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128090106] [2024-09-13 05:15:41,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128090106] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:41,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:41,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:41,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964805289] [2024-09-13 05:15:41,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:41,684 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:41,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:41,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:41,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:41,684 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 05:15:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:41,925 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2024-09-13 05:15:41,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:41,925 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 05:15:41,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:41,926 INFO L225 Difference]: With dead ends: 218 [2024-09-13 05:15:41,926 INFO L226 Difference]: Without dead ends: 218 [2024-09-13 05:15:41,926 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 05:15:41,927 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 05:15:41,927 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 05:15:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-09-13 05:15:41,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-09-13 05:15:41,929 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 05:15:41,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 229 transitions. [2024-09-13 05:15:41,929 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 229 transitions. Word has length 169 [2024-09-13 05:15:41,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:41,929 INFO L474 AbstractCegarLoop]: Abstraction has 218 states and 229 transitions. [2024-09-13 05:15:41,929 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 05:15:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 229 transitions. [2024-09-13 05:15:41,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-09-13 05:15:41,930 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:41,930 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 05:15:41,930 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-09-13 05:15:41,930 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 05:15:41,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:41,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2071729146, now seen corresponding path program 1 times [2024-09-13 05:15:41,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:41,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125597903] [2024-09-13 05:15:41,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:41,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:42,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:42,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125597903] [2024-09-13 05:15:42,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125597903] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:42,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:42,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:42,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585100044] [2024-09-13 05:15:42,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:42,060 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:42,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:42,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:42,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:42,061 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 05:15:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:42,370 INFO L93 Difference]: Finished difference Result 217 states and 227 transitions. [2024-09-13 05:15:42,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:42,370 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 05:15:42,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:42,371 INFO L225 Difference]: With dead ends: 217 [2024-09-13 05:15:42,371 INFO L226 Difference]: Without dead ends: 217 [2024-09-13 05:15:42,371 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 05:15:42,372 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:42,373 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.3s Time] [2024-09-13 05:15:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-09-13 05:15:42,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-09-13 05:15:42,375 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 05:15:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 227 transitions. [2024-09-13 05:15:42,375 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 227 transitions. Word has length 172 [2024-09-13 05:15:42,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:42,375 INFO L474 AbstractCegarLoop]: Abstraction has 217 states and 227 transitions. [2024-09-13 05:15:42,375 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 05:15:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 227 transitions. [2024-09-13 05:15:42,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-09-13 05:15:42,376 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:42,376 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:42,376 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-09-13 05:15:42,376 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 05:15:42,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:42,377 INFO L85 PathProgramCache]: Analyzing trace with hash -202339058, now seen corresponding path program 1 times [2024-09-13 05:15:42,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:42,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578519329] [2024-09-13 05:15:42,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:42,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:42,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:42,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578519329] [2024-09-13 05:15:42,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578519329] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:42,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:42,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876608320] [2024-09-13 05:15:42,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:42,511 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:42,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:42,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:42,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:42,512 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 05:15:42,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:42,826 INFO L93 Difference]: Finished difference Result 216 states and 225 transitions. [2024-09-13 05:15:42,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:42,826 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 05:15:42,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:42,827 INFO L225 Difference]: With dead ends: 216 [2024-09-13 05:15:42,827 INFO L226 Difference]: Without dead ends: 216 [2024-09-13 05:15:42,827 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 05:15:42,828 INFO L434 NwaCegarLoop]: 144 mSDtfsCounter, 42 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:42,828 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.3s Time] [2024-09-13 05:15:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-09-13 05:15:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-09-13 05:15:42,830 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 05:15:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 225 transitions. [2024-09-13 05:15:42,830 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 225 transitions. Word has length 175 [2024-09-13 05:15:42,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:42,830 INFO L474 AbstractCegarLoop]: Abstraction has 216 states and 225 transitions. [2024-09-13 05:15:42,830 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 05:15:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 225 transitions. [2024-09-13 05:15:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-09-13 05:15:42,831 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:42,831 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 05:15:42,831 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-09-13 05:15:42,831 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 05:15:42,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:42,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2043145074, now seen corresponding path program 1 times [2024-09-13 05:15:42,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:42,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293475181] [2024-09-13 05:15:42,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:42,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:42,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:42,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293475181] [2024-09-13 05:15:42,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293475181] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:42,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:42,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:42,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974422965] [2024-09-13 05:15:42,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:42,972 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:42,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:42,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:42,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:42,973 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 05:15:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:43,204 INFO L93 Difference]: Finished difference Result 215 states and 223 transitions. [2024-09-13 05:15:43,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:43,205 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 05:15:43,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:43,205 INFO L225 Difference]: With dead ends: 215 [2024-09-13 05:15:43,205 INFO L226 Difference]: Without dead ends: 215 [2024-09-13 05:15:43,205 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 05:15:43,206 INFO L434 NwaCegarLoop]: 143 mSDtfsCounter, 40 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 05:15:43,206 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 05:15:43,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-09-13 05:15:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-09-13 05:15:43,207 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 05:15:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 223 transitions. [2024-09-13 05:15:43,208 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 223 transitions. Word has length 178 [2024-09-13 05:15:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:43,208 INFO L474 AbstractCegarLoop]: Abstraction has 215 states and 223 transitions. [2024-09-13 05:15:43,208 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 05:15:43,208 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 223 transitions. [2024-09-13 05:15:43,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-09-13 05:15:43,209 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:43,209 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:15:43,209 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-09-13 05:15:43,209 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 05:15:43,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash 942244368, now seen corresponding path program 1 times [2024-09-13 05:15:43,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:43,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120875626] [2024-09-13 05:15:43,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:43,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:43,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:43,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120875626] [2024-09-13 05:15:43,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120875626] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:43,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:43,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067824306] [2024-09-13 05:15:43,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:43,351 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:43,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:43,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:43,352 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 05:15:43,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:43,597 INFO L93 Difference]: Finished difference Result 214 states and 221 transitions. [2024-09-13 05:15:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:43,598 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 05:15:43,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:43,598 INFO L225 Difference]: With dead ends: 214 [2024-09-13 05:15:43,598 INFO L226 Difference]: Without dead ends: 214 [2024-09-13 05:15:43,599 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 05:15:43,599 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 05:15:43,599 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 05:15:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-09-13 05:15:43,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-09-13 05:15:43,600 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 05:15:43,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 221 transitions. [2024-09-13 05:15:43,601 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 221 transitions. Word has length 181 [2024-09-13 05:15:43,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:43,601 INFO L474 AbstractCegarLoop]: Abstraction has 214 states and 221 transitions. [2024-09-13 05:15:43,601 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 05:15:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 221 transitions. [2024-09-13 05:15:43,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-09-13 05:15:43,602 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:43,602 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 05:15:43,602 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-09-13 05:15:43,602 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 05:15:43,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:43,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1503645104, now seen corresponding path program 1 times [2024-09-13 05:15:43,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:43,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914342056] [2024-09-13 05:15:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:43,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:43,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:43,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914342056] [2024-09-13 05:15:43,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914342056] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:43,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:43,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:43,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087875609] [2024-09-13 05:15:43,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:43,748 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:43,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:43,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:43,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:43,749 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 05:15:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:44,032 INFO L93 Difference]: Finished difference Result 213 states and 219 transitions. [2024-09-13 05:15:44,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:44,032 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 05:15:44,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:44,033 INFO L225 Difference]: With dead ends: 213 [2024-09-13 05:15:44,033 INFO L226 Difference]: Without dead ends: 213 [2024-09-13 05:15:44,033 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 05:15:44,033 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:44,033 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.3s Time] [2024-09-13 05:15:44,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-09-13 05:15:44,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-09-13 05:15:44,035 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 05:15:44,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 219 transitions. [2024-09-13 05:15:44,035 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 219 transitions. Word has length 184 [2024-09-13 05:15:44,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:44,036 INFO L474 AbstractCegarLoop]: Abstraction has 213 states and 219 transitions. [2024-09-13 05:15:44,036 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 05:15:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 219 transitions. [2024-09-13 05:15:44,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-09-13 05:15:44,037 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:44,037 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 05:15:44,037 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-09-13 05:15:44,037 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 05:15:44,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:44,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1418247954, now seen corresponding path program 1 times [2024-09-13 05:15:44,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:44,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229826963] [2024-09-13 05:15:44,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:44,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:44,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:44,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229826963] [2024-09-13 05:15:44,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229826963] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:44,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:44,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:44,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555430950] [2024-09-13 05:15:44,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:44,190 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:44,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:44,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:44,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:44,190 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 05:15:44,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:44,486 INFO L93 Difference]: Finished difference Result 212 states and 217 transitions. [2024-09-13 05:15:44,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:44,488 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 05:15:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:44,489 INFO L225 Difference]: With dead ends: 212 [2024-09-13 05:15:44,489 INFO L226 Difference]: Without dead ends: 212 [2024-09-13 05:15:44,489 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 05:15:44,489 INFO L434 NwaCegarLoop]: 140 mSDtfsCounter, 26 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:44,489 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.3s Time] [2024-09-13 05:15:44,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-09-13 05:15:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-09-13 05:15:44,491 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 05:15:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 217 transitions. [2024-09-13 05:15:44,492 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 217 transitions. Word has length 187 [2024-09-13 05:15:44,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:44,492 INFO L474 AbstractCegarLoop]: Abstraction has 212 states and 217 transitions. [2024-09-13 05:15:44,492 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 05:15:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 217 transitions. [2024-09-13 05:15:44,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-09-13 05:15:44,493 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:44,493 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 05:15:44,493 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-09-13 05:15:44,493 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 05:15:44,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:44,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1432160274, now seen corresponding path program 1 times [2024-09-13 05:15:44,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:44,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514198346] [2024-09-13 05:15:44,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:44,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:44,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:44,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514198346] [2024-09-13 05:15:44,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514198346] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:44,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:44,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:44,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357557401] [2024-09-13 05:15:44,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:44,631 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:44,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:44,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:44,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:44,632 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 05:15:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:44,900 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2024-09-13 05:15:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:44,901 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 05:15:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:44,901 INFO L225 Difference]: With dead ends: 211 [2024-09-13 05:15:44,902 INFO L226 Difference]: Without dead ends: 211 [2024-09-13 05:15:44,902 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 05:15:44,902 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:44,902 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.3s Time] [2024-09-13 05:15:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-09-13 05:15:44,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-09-13 05:15:44,904 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 05:15:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 215 transitions. [2024-09-13 05:15:44,904 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 215 transitions. Word has length 190 [2024-09-13 05:15:44,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:44,904 INFO L474 AbstractCegarLoop]: Abstraction has 211 states and 215 transitions. [2024-09-13 05:15:44,905 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 05:15:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 215 transitions. [2024-09-13 05:15:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-09-13 05:15:44,905 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:44,905 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 05:15:44,905 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-09-13 05:15:44,906 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 05:15:44,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:44,906 INFO L85 PathProgramCache]: Analyzing trace with hash -717732844, now seen corresponding path program 1 times [2024-09-13 05:15:44,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:44,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490712782] [2024-09-13 05:15:44,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:44,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:45,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:45,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490712782] [2024-09-13 05:15:45,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490712782] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:45,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:45,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:45,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36069056] [2024-09-13 05:15:45,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:45,092 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:45,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:45,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:45,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:45,093 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 05:15:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:45,392 INFO L93 Difference]: Finished difference Result 210 states and 213 transitions. [2024-09-13 05:15:45,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:45,392 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 05:15:45,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:45,393 INFO L225 Difference]: With dead ends: 210 [2024-09-13 05:15:45,393 INFO L226 Difference]: Without dead ends: 210 [2024-09-13 05:15:45,393 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 05:15:45,393 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:45,394 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.3s Time] [2024-09-13 05:15:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-09-13 05:15:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-09-13 05:15:45,395 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 05:15:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 213 transitions. [2024-09-13 05:15:45,396 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 213 transitions. Word has length 193 [2024-09-13 05:15:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:45,396 INFO L474 AbstractCegarLoop]: Abstraction has 210 states and 213 transitions. [2024-09-13 05:15:45,396 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 05:15:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 213 transitions. [2024-09-13 05:15:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-09-13 05:15:45,397 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:45,397 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 05:15:45,397 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-09-13 05:15:45,397 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 05:15:45,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:45,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1631283756, now seen corresponding path program 1 times [2024-09-13 05:15:45,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:45,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563172175] [2024-09-13 05:15:45,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:45,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:45,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:45,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563172175] [2024-09-13 05:15:45,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563172175] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:45,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:45,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:45,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349326525] [2024-09-13 05:15:45,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:45,558 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:45,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:45,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:45,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:45,559 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 05:15:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:45,802 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2024-09-13 05:15:45,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:45,803 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 05:15:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:45,804 INFO L225 Difference]: With dead ends: 209 [2024-09-13 05:15:45,804 INFO L226 Difference]: Without dead ends: 209 [2024-09-13 05:15:45,804 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 05:15:45,804 INFO L434 NwaCegarLoop]: 137 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 05:15:45,804 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 05:15:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-09-13 05:15:45,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-09-13 05:15:45,806 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 05:15:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 211 transitions. [2024-09-13 05:15:45,807 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 211 transitions. Word has length 196 [2024-09-13 05:15:45,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:45,807 INFO L474 AbstractCegarLoop]: Abstraction has 209 states and 211 transitions. [2024-09-13 05:15:45,807 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 05:15:45,807 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 211 transitions. [2024-09-13 05:15:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-09-13 05:15:45,808 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:45,808 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 05:15:45,808 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-09-13 05:15:45,808 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 05:15:45,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:45,808 INFO L85 PathProgramCache]: Analyzing trace with hash -18738922, now seen corresponding path program 1 times [2024-09-13 05:15:45,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:45,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473722514] [2024-09-13 05:15:45,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:45,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:45,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473722514] [2024-09-13 05:15:45,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473722514] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:45,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:45,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:45,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477101325] [2024-09-13 05:15:45,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:45,957 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:45,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:45,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:45,958 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 05:15:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:46,177 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2024-09-13 05:15:46,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:46,177 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 05:15:46,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:46,178 INFO L225 Difference]: With dead ends: 208 [2024-09-13 05:15:46,178 INFO L226 Difference]: Without dead ends: 208 [2024-09-13 05:15:46,178 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 05:15:46,178 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 05:15:46,179 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 05:15:46,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-09-13 05:15:46,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-09-13 05:15:46,181 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 05:15:46,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2024-09-13 05:15:46,181 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 199 [2024-09-13 05:15:46,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:46,181 INFO L474 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2024-09-13 05:15:46,181 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 05:15:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2024-09-13 05:15:46,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-09-13 05:15:46,182 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:46,182 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 05:15:46,182 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-09-13 05:15:46,182 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 05:15:46,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:46,183 INFO L85 PathProgramCache]: Analyzing trace with hash 95214474, now seen corresponding path program 1 times [2024-09-13 05:15:46,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:46,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618061296] [2024-09-13 05:15:46,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:46,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:15:46,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:46,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618061296] [2024-09-13 05:15:46,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618061296] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:46,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:46,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:15:46,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37863698] [2024-09-13 05:15:46,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:46,322 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:15:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:46,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:15:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:15:46,323 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 05:15:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:46,584 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2024-09-13 05:15:46,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:15:46,585 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 05:15:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:46,586 INFO L225 Difference]: With dead ends: 211 [2024-09-13 05:15:46,586 INFO L226 Difference]: Without dead ends: 211 [2024-09-13 05:15:46,586 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 05:15:46,586 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 05:15:46,586 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 05:15:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-09-13 05:15:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-09-13 05:15:46,588 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 05:15:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2024-09-13 05:15:46,589 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 202 [2024-09-13 05:15:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:46,589 INFO L474 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2024-09-13 05:15:46,589 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 05:15:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2024-09-13 05:15:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-09-13 05:15:46,589 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:46,590 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 05:15:46,590 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-09-13 05:15:46,590 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 05:15:46,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:46,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1856680139, now seen corresponding path program 1 times [2024-09-13 05:15:46,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:46,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431259745] [2024-09-13 05:15:46,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:46,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:46,785 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 05:15:46,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:46,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431259745] [2024-09-13 05:15:46,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431259745] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:15:46,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441666942] [2024-09-13 05:15:46,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:46,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:15:46,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:15:46,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:15:46,789 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 05:15:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:46,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 05:15:46,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:15:47,277 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 05:15:47,277 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:15:47,553 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 05:15:47,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441666942] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:15:47,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:15:47,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-09-13 05:15:47,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148493982] [2024-09-13 05:15:47,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:15:47,555 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 05:15:47,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:47,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 05:15:47,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-13 05:15:47,556 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 05:15:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:47,867 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2024-09-13 05:15:47,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 05:15:47,868 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 05:15:47,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:47,869 INFO L225 Difference]: With dead ends: 214 [2024-09-13 05:15:47,869 INFO L226 Difference]: Without dead ends: 214 [2024-09-13 05:15:47,869 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 05:15:47,870 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:47,870 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.3s Time] [2024-09-13 05:15:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-09-13 05:15:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-09-13 05:15:47,873 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 05:15:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 215 transitions. [2024-09-13 05:15:47,873 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 215 transitions. Word has length 205 [2024-09-13 05:15:47,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:47,873 INFO L474 AbstractCegarLoop]: Abstraction has 214 states and 215 transitions. [2024-09-13 05:15:47,873 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 05:15:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 215 transitions. [2024-09-13 05:15:47,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-09-13 05:15:47,874 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:47,874 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 05:15:47,893 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 05:15:48,075 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 05:15:48,076 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 05:15:48,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:48,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1769883626, now seen corresponding path program 2 times [2024-09-13 05:15:48,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:48,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948080201] [2024-09-13 05:15:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:48,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:48,346 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 05:15:48,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:48,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948080201] [2024-09-13 05:15:48,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948080201] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:15:48,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023942666] [2024-09-13 05:15:48,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 05:15:48,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:15:48,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:15:48,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:15:48,350 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 05:15:48,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 05:15:48,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:15:48,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-13 05:15:48,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:15:48,734 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 05:15:48,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:15:48,981 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 05:15:48,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023942666] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:15:48,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:15:48,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-09-13 05:15:48,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578657408] [2024-09-13 05:15:48,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:15:48,982 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 05:15:48,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:48,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 05:15:48,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-13 05:15:48,983 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 05:15:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:49,324 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2024-09-13 05:15:49,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 05:15:49,324 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 05:15:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:49,325 INFO L225 Difference]: With dead ends: 217 [2024-09-13 05:15:49,325 INFO L226 Difference]: Without dead ends: 217 [2024-09-13 05:15:49,325 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 05:15:49,325 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 05:15:49,326 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 05:15:49,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-09-13 05:15:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-09-13 05:15:49,327 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 05:15:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2024-09-13 05:15:49,328 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 208 [2024-09-13 05:15:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:49,328 INFO L474 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2024-09-13 05:15:49,328 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 05:15:49,328 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2024-09-13 05:15:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-09-13 05:15:49,329 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:49,329 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 05:15:49,347 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 05:15:49,529 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 05:15:49,530 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 05:15:49,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:49,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1585277035, now seen corresponding path program 3 times [2024-09-13 05:15:49,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:49,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259390987] [2024-09-13 05:15:49,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:49,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:49,844 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 05:15:49,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:49,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259390987] [2024-09-13 05:15:49,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259390987] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:15:49,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055081062] [2024-09-13 05:15:49,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 05:15:49,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:15:49,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:15:49,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:15:49,848 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 05:15:49,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-13 05:15:49,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:15:49,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-09-13 05:15:49,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:15:51,970 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 05:15:51,970 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 05:15:51,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055081062] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:51,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 05:15:51,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-09-13 05:15:51,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111864399] [2024-09-13 05:15:51,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:51,971 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 05:15:51,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:51,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 05:15:51,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-09-13 05:15:51,972 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 05:15:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:53,457 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2024-09-13 05:15:53,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 05:15:53,457 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 05:15:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:53,458 INFO L225 Difference]: With dead ends: 216 [2024-09-13 05:15:53,458 INFO L226 Difference]: Without dead ends: 216 [2024-09-13 05:15:53,458 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-09-13 05:15:53,459 INFO L434 NwaCegarLoop]: 136 mSDtfsCounter, 5 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:15:53,459 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 142 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-09-13 05:15:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-09-13 05:15:53,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2024-09-13 05:15:53,461 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 05:15:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2024-09-13 05:15:53,461 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 211 [2024-09-13 05:15:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:53,462 INFO L474 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2024-09-13 05:15:53,462 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 05:15:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2024-09-13 05:15:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-09-13 05:15:53,463 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:15:53,463 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 05:15:53,481 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-13 05:15:53,663 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 05:15:53,664 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 05:15:53,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:15:53,664 INFO L85 PathProgramCache]: Analyzing trace with hash -471529024, now seen corresponding path program 1 times [2024-09-13 05:15:53,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:15:53,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948198856] [2024-09-13 05:15:53,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:15:53,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:15:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:15:54,753 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 05:15:54,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:15:54,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948198856] [2024-09-13 05:15:54,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948198856] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:15:54,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:15:54,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 05:15:54,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085487730] [2024-09-13 05:15:54,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:15:54,754 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:15:54,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:15:54,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:15:54,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:15:54,755 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 05:15:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:15:55,007 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2024-09-13 05:15:55,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:15:55,008 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 05:15:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:15:55,008 INFO L225 Difference]: With dead ends: 213 [2024-09-13 05:15:55,008 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 05:15:55,008 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:15:55,009 INFO L434 NwaCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 05:15:55,009 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 05:15:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 05:15:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 05:15:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:15:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 05:15:55,009 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2024-09-13 05:15:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:15:55,009 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 05:15:55,009 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 05:15:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 05:15:55,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 05:15:55,011 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 68 remaining) [2024-09-13 05:15:55,012 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 68 remaining) [2024-09-13 05:15:55,012 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 68 remaining) [2024-09-13 05:15:55,012 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 68 remaining) [2024-09-13 05:15:55,012 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 68 remaining) [2024-09-13 05:15:55,012 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 68 remaining) [2024-09-13 05:15:55,012 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 68 remaining) [2024-09-13 05:15:55,012 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 68 remaining) [2024-09-13 05:15:55,012 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 68 remaining) [2024-09-13 05:15:55,012 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 68 remaining) [2024-09-13 05:15:55,012 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 68 remaining) [2024-09-13 05:15:55,012 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 68 remaining) [2024-09-13 05:15:55,013 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 68 remaining) [2024-09-13 05:15:55,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 68 remaining) [2024-09-13 05:15:55,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 68 remaining) [2024-09-13 05:15:55,016 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 68 remaining) [2024-09-13 05:15:55,016 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 68 remaining) [2024-09-13 05:15:55,016 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 68 remaining) [2024-09-13 05:15:55,016 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 68 remaining) [2024-09-13 05:15:55,016 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 68 remaining) [2024-09-13 05:15:55,016 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 68 remaining) [2024-09-13 05:15:55,016 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION (0 of 68 remaining) [2024-09-13 05:15:55,016 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-09-13 05:15:55,018 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 05:15:55,020 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 05:15:55,022 INFO L469 ceAbstractionStarter]: Automizer considered 67 witness invariants [2024-09-13 05:15:55,022 INFO L470 ceAbstractionStarter]: WitnessConsidered=67 [2024-09-13 05:15:55,023 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 05:15:55 BoogieIcfgContainer [2024-09-13 05:15:55,023 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 05:15:55,023 INFO L158 Benchmark]: Toolchain (without parser) took 43335.30ms. Allocated memory was 178.3MB in the beginning and 390.1MB in the end (delta: 211.8MB). Free memory was 105.4MB in the beginning and 144.0MB in the end (delta: -38.6MB). Peak memory consumption was 175.0MB. Max. memory is 16.1GB. [2024-09-13 05:15:55,023 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:15:55,023 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 178.3MB. Free memory was 110.0MB in the beginning and 109.8MB in the end (delta: 216.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:15:55,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.83ms. Allocated memory is still 178.3MB. Free memory was 105.2MB in the beginning and 132.6MB in the end (delta: -27.4MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-09-13 05:15:55,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.38ms. Allocated memory is still 178.3MB. Free memory was 132.6MB in the beginning and 128.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-13 05:15:55,024 INFO L158 Benchmark]: Boogie Preprocessor took 64.72ms. Allocated memory is still 178.3MB. Free memory was 128.6MB in the beginning and 124.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-13 05:15:55,024 INFO L158 Benchmark]: RCFGBuilder took 1077.53ms. Allocated memory is still 178.3MB. Free memory was 124.4MB in the beginning and 110.0MB in the end (delta: 14.4MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2024-09-13 05:15:55,024 INFO L158 Benchmark]: TraceAbstraction took 41545.77ms. Allocated memory was 178.3MB in the beginning and 390.1MB in the end (delta: 211.8MB). Free memory was 108.9MB in the beginning and 144.0MB in the end (delta: -35.1MB). Peak memory consumption was 176.8MB. Max. memory is 16.1GB. [2024-09-13 05:15:55,025 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.12ms. Allocated memory is still 178.3MB. Free memory was 110.0MB in the beginning and 109.8MB in the end (delta: 216.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.83ms. Allocated memory is still 178.3MB. Free memory was 105.2MB in the beginning and 132.6MB in the end (delta: -27.4MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.38ms. Allocated memory is still 178.3MB. Free memory was 132.6MB in the beginning and 128.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.72ms. Allocated memory is still 178.3MB. Free memory was 128.6MB in the beginning and 124.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1077.53ms. Allocated memory is still 178.3MB. Free memory was 124.4MB in the beginning and 110.0MB in the end (delta: 14.4MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * TraceAbstraction took 41545.77ms. Allocated memory was 178.3MB in the beginning and 390.1MB in the end (delta: 211.8MB). Free memory was 108.9MB in the beginning and 144.0MB in the end (delta: -35.1MB). Peak memory consumption was 176.8MB. 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: 41.5s, OverallIterations: 71, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 27.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3937 SdHoareTripleChecker+Valid, 25.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3937 mSDsluCounter, 12531 SdHoareTripleChecker+Invalid, 21.0s 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.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1253 GetRequests, 1032 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.2s 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.3s AutomataMinimizationTime, 71 MinimizatonAttempts, 1129 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.8s 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 05:15:55,057 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