./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 04d6fb36 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/loop-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-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 20:10:45,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 20:10:45,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 20:10:45,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 20:10:45,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 20:10:45,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 20:10:45,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 20:10:45,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 20:10:45,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 20:10:45,746 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 20:10:45,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 20:10:45,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 20:10:45,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 20:10:45,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 20:10:45,749 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 20:10:45,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 20:10:45,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 20:10:45,750 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 20:10:45,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 20:10:45,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 20:10:45,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 20:10:45,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 20:10:45,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 20:10:45,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 20:10:45,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 20:10:45,752 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 20:10:45,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 20:10:45,752 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 20:10:45,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 20:10:45,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 20:10:45,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 20:10:45,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 20:10:45,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:10:45,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 20:10:45,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 20:10:45,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 20:10:45,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 20:10:45,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 20:10:45,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 20:10:45,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 20:10:45,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 20:10:45,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 20:10:45,763 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-15 20:10:45,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 20:10:46,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 20:10:46,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 20:10:46,018 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 20:10:46,018 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 20:10:46,019 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-15 20:10:47,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 20:10:47,427 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 20:10:47,427 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2024-09-15 20:10:47,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/8e39e1b3d/7123949eedef4e2e8c7aa0f54c4df10b/FLAGcdf4818ed [2024-09-15 20:10:47,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/8e39e1b3d/7123949eedef4e2e8c7aa0f54c4df10b [2024-09-15 20:10:47,448 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-15 20:10:47,448 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-15 20:10:47,449 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-15 20:10:47,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 20:10:47,526 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-15 20:10:47,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 20:10:47,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 20:10:47,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 20:10:47,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:10:47" (1/2) ... [2024-09-15 20:10:47,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a1eac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:47, skipping insertion in model container [2024-09-15 20:10:47,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:10:47" (1/2) ... [2024-09-15 20:10:47,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7b3071fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:47, skipping insertion in model container [2024-09-15 20:10:47,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:10:47" (2/2) ... [2024-09-15 20:10:47,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a1eac1 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:47, skipping insertion in model container [2024-09-15 20:10:47,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:10:47" (2/2) ... [2024-09-15 20:10:47,573 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-15 20:10:47,574 INFO L1541 ArrayList]: Location invariant before [L323-L645] (((51 == main__y) && (51 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,574 INFO L1541 ArrayList]: Location invariant before [L71-L1149] (((9 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,574 INFO L1541 ArrayList]: Location invariant before [L173-L945] (((26 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,574 INFO L1541 ArrayList]: Location invariant before [L125-L1041] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (18 == main__x)) [2024-09-15 20:10:47,574 INFO L1541 ArrayList]: Location invariant before [L269-L753] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (42 == main__x)) [2024-09-15 20:10:47,574 INFO L1541 ArrayList]: Location invariant before [L47-L1197] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (5 == main__x)) [2024-09-15 20:10:47,574 INFO L1541 ArrayList]: Location invariant before [L83-L1125] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (11 == main__x)) [2024-09-15 20:10:47,574 INFO L1541 ArrayList]: Location invariant before [L389-L513] (((62 == main__x) && (62 == main__y)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,575 INFO L1541 ArrayList]: Location invariant before [L221-L849] (((main__y == 50) && (34 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,575 INFO L1541 ArrayList]: Location invariant before [L149-L993] (((22 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,575 INFO L1541 ArrayList]: Location invariant before [L179-L933] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (main__x == 27)) [2024-09-15 20:10:47,575 INFO L1541 ArrayList]: Location invariant before [L317-L657] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (main__x == 50)) [2024-09-15 20:10:47,575 INFO L1541 ArrayList]: Location invariant before [L107-L1077] (((15 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,575 INFO L1541 ArrayList]: Location invariant before [L29-L1233] (((2 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,575 INFO L1541 ArrayList]: Location invariant before [L113-L1065] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (16 == main__x)) [2024-09-15 20:10:47,575 INFO L1541 ArrayList]: Location invariant before [L257-L777] (((main__y == 50) && (40 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,575 INFO L1541 ArrayList]: Location invariant before [L167-L957] (((25 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,575 INFO L1541 ArrayList]: Location invariant before [L77-L1137] (((10 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,576 INFO L1541 ArrayList]: Location invariant before [L227-L837] (((35 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,576 INFO L1541 ArrayList]: Location invariant before [L155-L981] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (23 == main__x)) [2024-09-15 20:10:47,576 INFO L1541 ArrayList]: Location invariant before [L383-L525] (((main__x == 61) && (main__y == 61)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L191-L909] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (29 == main__x)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L293-L705] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (46 == main__x)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L203-L885] (((31 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L359-L573] (((\old(__return_1121) == __return_1121) && (57 == main__x)) && (57 == main__y)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L161-L969] (((main__x == 24) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L341-L609] (((main__y == 54) && (main__x == 54)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L119-L1053] (((main__y == 50) && (17 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L305-L681] (((48 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L353-L585] (((56 == main__x) && (\old(__return_1121) == __return_1121)) && (56 == main__y)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L281-L729] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (44 == main__x)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L197-L897] (((main__y == 50) && (30 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L53-L1185] (((main__y == 50) && (6 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L311-L669] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (49 == main__x)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L347-L597] (((55 == main__x) && (\old(__return_1121) == __return_1121)) && (55 == main__y)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L59-L1173] (((7 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L401-L489] (((64 == main__x) && (64 == main__y)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,577 INFO L1541 ArrayList]: Location invariant before [L239-L813] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (37 == main__x)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L395-L501] (((63 == main__x) && (63 == main__y)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L209-L873] (((32 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L95-L1101] (((13 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L407-L477] (((65 == main__y) && (\old(__return_1121) == __return_1121)) && (65 == main__x)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L101-L1089] (((14 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L263-L765] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (41 == main__x)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L287-L717] (((main__y == 50) && (45 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L89-L1113] (((12 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L413-L465] (((66 == main__y) && (66 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L35-L1221] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (3 == main__x)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L335-L621] (((53 == main__y) && (53 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L131-L1029] (((main__y == 50) && (19 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L143-L1005] (((21 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L215-L861] (((33 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L185-L921] (((28 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,578 INFO L1541 ArrayList]: Location invariant before [L65-L1161] (((8 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,579 INFO L1541 ArrayList]: Location invariant before [L41-L1209] (((4 == main__x) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,579 INFO L1541 ArrayList]: Location invariant before [L251-L789] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (39 == main__x)) [2024-09-15 20:10:47,579 INFO L1541 ArrayList]: Location invariant before [L275-L741] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (43 == main__x)) [2024-09-15 20:10:47,579 INFO L1541 ArrayList]: Location invariant before [L233-L825] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (36 == main__x)) [2024-09-15 20:10:47,579 INFO L1541 ArrayList]: Location invariant before [L377-L537] (((60 == main__x) && (60 == main__y)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,579 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-15 20:10:47,580 INFO L1541 ArrayList]: Location invariant before [L365-L561] (((58 == main__y) && (\old(__return_1121) == __return_1121)) && (58 == main__x)) [2024-09-15 20:10:47,581 INFO L1541 ArrayList]: Location invariant before [L299-L693] (((main__y == 50) && (47 == main__x)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,581 INFO L1541 ArrayList]: Location invariant before [L329-L633] (((52 == main__y) && (\old(__return_1121) == __return_1121)) && (52 == main__x)) [2024-09-15 20:10:47,581 INFO L1541 ArrayList]: Location invariant before [L371-L549] (((59 == main__y) && (\old(__return_1121) == __return_1121)) && (59 == main__x)) [2024-09-15 20:10:47,581 INFO L1541 ArrayList]: Location invariant before [L23-L1245] (((main__x == 1) && (main__y == 50)) && (\old(__return_1121) == __return_1121)) [2024-09-15 20:10:47,581 INFO L1541 ArrayList]: Location invariant before [L245-L801] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (38 == main__x)) [2024-09-15 20:10:47,581 INFO L1541 ArrayList]: Location invariant before [L137-L1017] (((main__y == 50) && (\old(__return_1121) == __return_1121)) && (20 == main__x)) [2024-09-15 20:10:47,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 20:10:47,784 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] [2024-09-15 20:10:47,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:10:47,836 INFO L200 MainTranslator]: Completed pre-run [2024-09-15 20:10:47,865 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-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-15 20:10:47,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:10:47,987 INFO L204 MainTranslator]: Completed translation [2024-09-15 20:10:47,987 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:47 WrapperNode [2024-09-15 20:10:47,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 20:10:47,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 20:10:47,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 20:10:47,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 20:10:47,993 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 15.09 08:10:47" (1/1) ... [2024-09-15 20:10:48,001 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 15.09 08:10:47" (1/1) ... [2024-09-15 20:10:48,045 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 771 [2024-09-15 20:10:48,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 20:10:48,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 20:10:48,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 20:10:48,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 20:10:48,056 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 15.09 08:10:47" (1/1) ... [2024-09-15 20:10:48,056 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 15.09 08:10:47" (1/1) ... [2024-09-15 20:10:48,058 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 15.09 08:10:47" (1/1) ... [2024-09-15 20:10:48,077 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-15 20:10:48,077 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 15.09 08:10:47" (1/1) ... [2024-09-15 20:10:48,077 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 15.09 08:10:47" (1/1) ... [2024-09-15 20:10:48,085 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 15.09 08:10:47" (1/1) ... [2024-09-15 20:10:48,089 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 15.09 08:10:47" (1/1) ... [2024-09-15 20:10:48,090 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 15.09 08:10:47" (1/1) ... [2024-09-15 20:10:48,091 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 15.09 08:10:47" (1/1) ... [2024-09-15 20:10:48,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 20:10:48,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 20:10:48,095 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 20:10:48,095 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 20:10:48,095 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 15.09 08:10:47" (1/1) ... [2024-09-15 20:10:48,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:10:48,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:10:48,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-15 20:10:48,155 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-15 20:10:48,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 20:10:48,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-15 20:10:48,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 20:10:48,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 20:10:48,240 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 20:10:48,242 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 20:10:48,924 INFO L? ?]: Removed 275 outVars from TransFormulas that were not future-live. [2024-09-15 20:10:48,924 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 20:10:49,024 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 20:10:49,024 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-15 20:10:49,024 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:10:49 BoogieIcfgContainer [2024-09-15 20:10:49,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 20:10:49,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 20:10:49,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 20:10:49,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 20:10:49,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 08:10:47" (1/4) ... [2024-09-15 20:10:49,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fba0bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:10:49, skipping insertion in model container [2024-09-15 20:10:49,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:10:47" (2/4) ... [2024-09-15 20:10:49,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fba0bbc and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 15.09 08:10:49, skipping insertion in model container [2024-09-15 20:10:49,033 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 15.09 08:10:47" (3/4) ... [2024-09-15 20:10:49,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fba0bbc and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 15.09 08:10:49, skipping insertion in model container [2024-09-15 20:10:49,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:10:49" (4/4) ... [2024-09-15 20:10:49,034 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2024-09-15 20:10:49,048 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 20:10:49,048 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 68 error locations. [2024-09-15 20:10:49,084 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 20:10:49,089 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;@3bb6553e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 20:10:49,089 INFO L337 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2024-09-15 20:10:49,094 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-15 20:10:49,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-09-15 20:10:49,098 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:49,099 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-09-15 20:10:49,099 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-15 20:10:49,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash 29588506, now seen corresponding path program 1 times [2024-09-15 20:10:49,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:49,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025984183] [2024-09-15 20:10:49,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:49,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:49,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:49,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025984183] [2024-09-15 20:10:49,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025984183] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:49,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:49,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 20:10:49,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019154171] [2024-09-15 20:10:49,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:49,404 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:49,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:49,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:49,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:49,427 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-15 20:10:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:50,117 INFO L93 Difference]: Finished difference Result 275 states and 406 transitions. [2024-09-15 20:10:50,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:50,119 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-15 20:10:50,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:50,126 INFO L225 Difference]: With dead ends: 275 [2024-09-15 20:10:50,126 INFO L226 Difference]: Without dead ends: 273 [2024-09-15 20:10:50,127 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-15 20:10:50,130 INFO L434 NwaCegarLoop]: 267 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:50,130 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-15 20:10:50,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-09-15 20:10:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-09-15 20:10:50,173 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-15 20:10:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 339 transitions. [2024-09-15 20:10:50,177 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 339 transitions. Word has length 4 [2024-09-15 20:10:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:50,178 INFO L474 AbstractCegarLoop]: Abstraction has 273 states and 339 transitions. [2024-09-15 20:10:50,178 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-15 20:10:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 339 transitions. [2024-09-15 20:10:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-15 20:10:50,179 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:50,179 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:50,179 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 20:10:50,179 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-15 20:10:50,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1002932306, now seen corresponding path program 1 times [2024-09-15 20:10:50,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:50,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627429014] [2024-09-15 20:10:50,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:50,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:50,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:50,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627429014] [2024-09-15 20:10:50,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627429014] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:50,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:50,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:50,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408626634] [2024-09-15 20:10:50,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:50,300 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:50,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:50,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:50,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:50,301 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-15 20:10:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:50,905 INFO L93 Difference]: Finished difference Result 320 states and 432 transitions. [2024-09-15 20:10:50,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:50,906 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-15 20:10:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:50,907 INFO L225 Difference]: With dead ends: 320 [2024-09-15 20:10:50,907 INFO L226 Difference]: Without dead ends: 320 [2024-09-15 20:10:50,908 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:50,908 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 124 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:50,909 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.6s Time] [2024-09-15 20:10:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-09-15 20:10:50,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 273. [2024-09-15 20:10:50,922 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-15 20:10:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 338 transitions. [2024-09-15 20:10:50,923 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 338 transitions. Word has length 7 [2024-09-15 20:10:50,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:50,926 INFO L474 AbstractCegarLoop]: Abstraction has 273 states and 338 transitions. [2024-09-15 20:10:50,926 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-15 20:10:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 338 transitions. [2024-09-15 20:10:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-15 20:10:50,926 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:50,926 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:50,926 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 20:10:50,926 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-15 20:10:50,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:50,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1731094578, now seen corresponding path program 1 times [2024-09-15 20:10:50,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:50,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286158491] [2024-09-15 20:10:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:50,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:51,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:51,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286158491] [2024-09-15 20:10:51,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286158491] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:51,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:51,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:51,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298222815] [2024-09-15 20:10:51,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:51,028 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:51,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:51,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:51,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:51,028 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-15 20:10:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:51,596 INFO L93 Difference]: Finished difference Result 318 states and 428 transitions. [2024-09-15 20:10:51,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:51,597 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-15 20:10:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:51,598 INFO L225 Difference]: With dead ends: 318 [2024-09-15 20:10:51,598 INFO L226 Difference]: Without dead ends: 318 [2024-09-15 20:10:51,598 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:51,599 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 122 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:51,599 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.6s Time] [2024-09-15 20:10:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-09-15 20:10:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 272. [2024-09-15 20:10:51,605 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-15 20:10:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 336 transitions. [2024-09-15 20:10:51,611 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 336 transitions. Word has length 10 [2024-09-15 20:10:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:51,611 INFO L474 AbstractCegarLoop]: Abstraction has 272 states and 336 transitions. [2024-09-15 20:10:51,611 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-15 20:10:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 336 transitions. [2024-09-15 20:10:51,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-15 20:10:51,612 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:51,612 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:51,612 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-15 20:10:51,612 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-15 20:10:51,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:51,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1366184436, now seen corresponding path program 1 times [2024-09-15 20:10:51,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:51,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771572756] [2024-09-15 20:10:51,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:51,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:51,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:51,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:51,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771572756] [2024-09-15 20:10:51,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771572756] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:51,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:51,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:51,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91634589] [2024-09-15 20:10:51,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:51,701 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:51,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:51,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:51,702 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-15 20:10:52,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:52,086 INFO L93 Difference]: Finished difference Result 316 states and 424 transitions. [2024-09-15 20:10:52,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:52,086 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-15 20:10:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:52,087 INFO L225 Difference]: With dead ends: 316 [2024-09-15 20:10:52,087 INFO L226 Difference]: Without dead ends: 316 [2024-09-15 20:10:52,088 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-15 20:10:52,088 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 121 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:52,088 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 188 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 20:10:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-09-15 20:10:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 271. [2024-09-15 20:10:52,093 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-15 20:10:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2024-09-15 20:10:52,094 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 13 [2024-09-15 20:10:52,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:52,094 INFO L474 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2024-09-15 20:10:52,094 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-15 20:10:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2024-09-15 20:10:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 20:10:52,094 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:52,094 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:52,095 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-15 20:10:52,095 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-15 20:10:52,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:52,095 INFO L85 PathProgramCache]: Analyzing trace with hash -890360382, now seen corresponding path program 1 times [2024-09-15 20:10:52,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:52,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470947762] [2024-09-15 20:10:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:52,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:52,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-15 20:10:52,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470947762] [2024-09-15 20:10:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470947762] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:52,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:52,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:52,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360507824] [2024-09-15 20:10:52,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:52,200 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:52,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:52,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:52,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:52,201 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-15 20:10:52,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:52,580 INFO L93 Difference]: Finished difference Result 314 states and 420 transitions. [2024-09-15 20:10:52,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:52,580 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-15 20:10:52,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:52,581 INFO L225 Difference]: With dead ends: 314 [2024-09-15 20:10:52,581 INFO L226 Difference]: Without dead ends: 314 [2024-09-15 20:10:52,581 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-15 20:10:52,582 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 119 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:52,582 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-15 20:10:52,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-09-15 20:10:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 270. [2024-09-15 20:10:52,586 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-15 20:10:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 332 transitions. [2024-09-15 20:10:52,587 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 332 transitions. Word has length 16 [2024-09-15 20:10:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:52,587 INFO L474 AbstractCegarLoop]: Abstraction has 270 states and 332 transitions. [2024-09-15 20:10:52,587 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-15 20:10:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 332 transitions. [2024-09-15 20:10:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-15 20:10:52,587 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:52,588 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:52,588 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-15 20:10:52,588 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-15 20:10:52,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:52,588 INFO L85 PathProgramCache]: Analyzing trace with hash 991965440, now seen corresponding path program 1 times [2024-09-15 20:10:52,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:52,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392385322] [2024-09-15 20:10:52,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:52,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:52,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:52,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392385322] [2024-09-15 20:10:52,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392385322] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:52,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:52,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:52,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645182941] [2024-09-15 20:10:52,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:52,676 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:52,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:52,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:52,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:52,677 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-15 20:10:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:53,146 INFO L93 Difference]: Finished difference Result 312 states and 416 transitions. [2024-09-15 20:10:53,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:53,146 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-15 20:10:53,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:53,147 INFO L225 Difference]: With dead ends: 312 [2024-09-15 20:10:53,147 INFO L226 Difference]: Without dead ends: 312 [2024-09-15 20:10:53,148 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-15 20:10:53,148 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 114 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:53,148 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 192 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-15 20:10:53,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-09-15 20:10:53,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 269. [2024-09-15 20:10:53,152 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-15 20:10:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 330 transitions. [2024-09-15 20:10:53,153 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 330 transitions. Word has length 19 [2024-09-15 20:10:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:53,153 INFO L474 AbstractCegarLoop]: Abstraction has 269 states and 330 transitions. [2024-09-15 20:10:53,153 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-15 20:10:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 330 transitions. [2024-09-15 20:10:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-15 20:10:53,154 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:53,154 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-15 20:10:53,154 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-15 20:10:53,154 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-15 20:10:53,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:53,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2027445322, now seen corresponding path program 1 times [2024-09-15 20:10:53,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:53,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933149536] [2024-09-15 20:10:53,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:53,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:53,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:53,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933149536] [2024-09-15 20:10:53,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933149536] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:53,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:53,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:53,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202397710] [2024-09-15 20:10:53,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:53,239 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:53,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:53,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:53,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:53,240 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-15 20:10:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:53,658 INFO L93 Difference]: Finished difference Result 310 states and 412 transitions. [2024-09-15 20:10:53,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:53,661 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-15 20:10:53,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:53,662 INFO L225 Difference]: With dead ends: 310 [2024-09-15 20:10:53,662 INFO L226 Difference]: Without dead ends: 310 [2024-09-15 20:10:53,663 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-15 20:10:53,664 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 112 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:53,664 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 192 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 20:10:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-09-15 20:10:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 268. [2024-09-15 20:10:53,667 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-15 20:10:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 328 transitions. [2024-09-15 20:10:53,668 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 328 transitions. Word has length 22 [2024-09-15 20:10:53,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:53,668 INFO L474 AbstractCegarLoop]: Abstraction has 268 states and 328 transitions. [2024-09-15 20:10:53,668 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-15 20:10:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 328 transitions. [2024-09-15 20:10:53,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-15 20:10:53,670 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:53,673 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-15 20:10:53,673 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-15 20:10:53,673 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-15 20:10:53,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash 501601268, now seen corresponding path program 1 times [2024-09-15 20:10:53,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:53,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139206707] [2024-09-15 20:10:53,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:53,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:53,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:53,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139206707] [2024-09-15 20:10:53,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139206707] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:53,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:53,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:53,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775129836] [2024-09-15 20:10:53,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:53,742 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:53,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:53,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:53,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:53,749 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-15 20:10:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:54,174 INFO L93 Difference]: Finished difference Result 308 states and 408 transitions. [2024-09-15 20:10:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:54,174 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-15 20:10:54,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:54,175 INFO L225 Difference]: With dead ends: 308 [2024-09-15 20:10:54,175 INFO L226 Difference]: Without dead ends: 308 [2024-09-15 20:10:54,175 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:54,176 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 109 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:54,176 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 192 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 20:10:54,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-09-15 20:10:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 267. [2024-09-15 20:10:54,179 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-15 20:10:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 326 transitions. [2024-09-15 20:10:54,180 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 326 transitions. Word has length 25 [2024-09-15 20:10:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:54,180 INFO L474 AbstractCegarLoop]: Abstraction has 267 states and 326 transitions. [2024-09-15 20:10:54,180 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-15 20:10:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 326 transitions. [2024-09-15 20:10:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-15 20:10:54,180 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:54,181 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-15 20:10:54,181 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-15 20:10:54,181 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-15 20:10:54,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:54,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1012267434, now seen corresponding path program 1 times [2024-09-15 20:10:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:54,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873054169] [2024-09-15 20:10:54,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:54,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:54,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:54,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873054169] [2024-09-15 20:10:54,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873054169] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:54,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:54,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:54,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551492838] [2024-09-15 20:10:54,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:54,233 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:54,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:54,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:54,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:54,233 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-15 20:10:54,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:54,527 INFO L93 Difference]: Finished difference Result 306 states and 404 transitions. [2024-09-15 20:10:54,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:54,528 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-15 20:10:54,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:54,528 INFO L225 Difference]: With dead ends: 306 [2024-09-15 20:10:54,529 INFO L226 Difference]: Without dead ends: 306 [2024-09-15 20:10:54,529 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-15 20:10:54,529 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 108 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:54,529 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 188 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-09-15 20:10:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 266. [2024-09-15 20:10:54,535 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-15 20:10:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2024-09-15 20:10:54,535 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 28 [2024-09-15 20:10:54,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:54,536 INFO L474 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2024-09-15 20:10:54,536 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-15 20:10:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2024-09-15 20:10:54,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-15 20:10:54,536 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:54,536 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-15 20:10:54,537 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-15 20:10:54,537 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-15 20:10:54,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:54,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1493866216, now seen corresponding path program 1 times [2024-09-15 20:10:54,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:54,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503526659] [2024-09-15 20:10:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:54,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:54,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:54,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503526659] [2024-09-15 20:10:54,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503526659] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:54,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:54,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:54,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402548872] [2024-09-15 20:10:54,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:54,593 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:54,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:54,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:54,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:54,593 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-15 20:10:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:54,969 INFO L93 Difference]: Finished difference Result 304 states and 400 transitions. [2024-09-15 20:10:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:54,970 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-15 20:10:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:54,970 INFO L225 Difference]: With dead ends: 304 [2024-09-15 20:10:54,971 INFO L226 Difference]: Without dead ends: 304 [2024-09-15 20:10:54,971 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-15 20:10:54,971 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 106 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:54,971 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-15 20:10:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-09-15 20:10:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 265. [2024-09-15 20:10:54,974 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-15 20:10:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 322 transitions. [2024-09-15 20:10:54,975 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 322 transitions. Word has length 31 [2024-09-15 20:10:54,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:54,975 INFO L474 AbstractCegarLoop]: Abstraction has 265 states and 322 transitions. [2024-09-15 20:10:54,975 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-15 20:10:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 322 transitions. [2024-09-15 20:10:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-15 20:10:54,976 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:54,976 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-15 20:10:54,976 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-15 20:10:54,978 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-15 20:10:54,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:54,979 INFO L85 PathProgramCache]: Analyzing trace with hash -682545250, now seen corresponding path program 1 times [2024-09-15 20:10:54,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:54,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806156362] [2024-09-15 20:10:54,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:54,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:55,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:55,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806156362] [2024-09-15 20:10:55,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806156362] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:55,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:55,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:55,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034443885] [2024-09-15 20:10:55,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:55,053 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:55,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:55,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:55,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:55,054 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-15 20:10:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:55,343 INFO L93 Difference]: Finished difference Result 302 states and 396 transitions. [2024-09-15 20:10:55,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:55,346 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-15 20:10:55,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:55,347 INFO L225 Difference]: With dead ends: 302 [2024-09-15 20:10:55,347 INFO L226 Difference]: Without dead ends: 302 [2024-09-15 20:10:55,347 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-15 20:10:55,347 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 104 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:55,347 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 188 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-09-15 20:10:55,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 264. [2024-09-15 20:10:55,350 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-15 20:10:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 320 transitions. [2024-09-15 20:10:55,351 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 320 transitions. Word has length 34 [2024-09-15 20:10:55,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:55,351 INFO L474 AbstractCegarLoop]: Abstraction has 264 states and 320 transitions. [2024-09-15 20:10:55,351 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-15 20:10:55,351 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 320 transitions. [2024-09-15 20:10:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-15 20:10:55,352 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:55,352 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-15 20:10:55,352 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-15 20:10:55,352 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-15 20:10:55,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:55,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1330218530, now seen corresponding path program 1 times [2024-09-15 20:10:55,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:55,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180632067] [2024-09-15 20:10:55,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:55,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:55,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:55,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180632067] [2024-09-15 20:10:55,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180632067] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:55,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:55,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:55,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514343665] [2024-09-15 20:10:55,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:55,433 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:55,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:55,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:55,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:55,434 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-15 20:10:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:55,847 INFO L93 Difference]: Finished difference Result 300 states and 392 transitions. [2024-09-15 20:10:55,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:55,848 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-15 20:10:55,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:55,849 INFO L225 Difference]: With dead ends: 300 [2024-09-15 20:10:55,849 INFO L226 Difference]: Without dead ends: 300 [2024-09-15 20:10:55,849 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-15 20:10:55,849 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 99 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:55,850 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 192 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 20:10:55,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-09-15 20:10:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 263. [2024-09-15 20:10:55,852 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-15 20:10:55,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 318 transitions. [2024-09-15 20:10:55,853 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 318 transitions. Word has length 37 [2024-09-15 20:10:55,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:55,853 INFO L474 AbstractCegarLoop]: Abstraction has 263 states and 318 transitions. [2024-09-15 20:10:55,853 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-15 20:10:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 318 transitions. [2024-09-15 20:10:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-15 20:10:55,854 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:55,854 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-15 20:10:55,854 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-15 20:10:55,854 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-15 20:10:55,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:55,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1123167824, now seen corresponding path program 1 times [2024-09-15 20:10:55,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:55,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341536174] [2024-09-15 20:10:55,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:55,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:55,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:55,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341536174] [2024-09-15 20:10:55,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341536174] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:55,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:55,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166369688] [2024-09-15 20:10:55,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:55,925 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:55,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:55,927 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-15 20:10:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:56,329 INFO L93 Difference]: Finished difference Result 298 states and 388 transitions. [2024-09-15 20:10:56,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:56,330 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-15 20:10:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:56,331 INFO L225 Difference]: With dead ends: 298 [2024-09-15 20:10:56,331 INFO L226 Difference]: Without dead ends: 298 [2024-09-15 20:10:56,331 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-15 20:10:56,331 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 97 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:56,331 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-15 20:10:56,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-09-15 20:10:56,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 262. [2024-09-15 20:10:56,334 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-15 20:10:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 316 transitions. [2024-09-15 20:10:56,335 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 316 transitions. Word has length 40 [2024-09-15 20:10:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:56,335 INFO L474 AbstractCegarLoop]: Abstraction has 262 states and 316 transitions. [2024-09-15 20:10:56,335 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-15 20:10:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 316 transitions. [2024-09-15 20:10:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-15 20:10:56,336 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:56,336 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-15 20:10:56,336 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-15 20:10:56,336 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-15 20:10:56,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:56,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1797393582, now seen corresponding path program 1 times [2024-09-15 20:10:56,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:56,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848853171] [2024-09-15 20:10:56,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:56,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:56,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-15 20:10:56,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:56,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848853171] [2024-09-15 20:10:56,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848853171] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:56,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:56,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:56,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14008360] [2024-09-15 20:10:56,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:56,402 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:56,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:56,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:56,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:56,402 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-15 20:10:56,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:56,738 INFO L93 Difference]: Finished difference Result 296 states and 384 transitions. [2024-09-15 20:10:56,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:56,739 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-15 20:10:56,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:56,740 INFO L225 Difference]: With dead ends: 296 [2024-09-15 20:10:56,740 INFO L226 Difference]: Without dead ends: 296 [2024-09-15 20:10:56,740 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:56,740 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.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:56,741 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 188 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:56,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-09-15 20:10:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 261. [2024-09-15 20:10:56,743 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-15 20:10:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 314 transitions. [2024-09-15 20:10:56,744 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 314 transitions. Word has length 43 [2024-09-15 20:10:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:56,744 INFO L474 AbstractCegarLoop]: Abstraction has 261 states and 314 transitions. [2024-09-15 20:10:56,744 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-15 20:10:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 314 transitions. [2024-09-15 20:10:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-15 20:10:56,745 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:56,745 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-15 20:10:56,745 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-15 20:10:56,745 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-15 20:10:56,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:56,745 INFO L85 PathProgramCache]: Analyzing trace with hash -794747318, now seen corresponding path program 1 times [2024-09-15 20:10:56,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:56,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238815260] [2024-09-15 20:10:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:56,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:56,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238815260] [2024-09-15 20:10:56,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238815260] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:56,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:56,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:56,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699196465] [2024-09-15 20:10:56,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:56,808 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:56,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:56,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:56,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:56,809 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-15 20:10:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:57,213 INFO L93 Difference]: Finished difference Result 294 states and 380 transitions. [2024-09-15 20:10:57,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:57,213 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-15 20:10:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:57,214 INFO L225 Difference]: With dead ends: 294 [2024-09-15 20:10:57,214 INFO L226 Difference]: Without dead ends: 294 [2024-09-15 20:10:57,214 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-15 20:10:57,214 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-15 20:10:57,215 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-15 20:10:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-09-15 20:10:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 260. [2024-09-15 20:10:57,218 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-15 20:10:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 312 transitions. [2024-09-15 20:10:57,218 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 312 transitions. Word has length 46 [2024-09-15 20:10:57,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:57,218 INFO L474 AbstractCegarLoop]: Abstraction has 260 states and 312 transitions. [2024-09-15 20:10:57,218 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-15 20:10:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 312 transitions. [2024-09-15 20:10:57,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-15 20:10:57,219 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:57,219 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-15 20:10:57,219 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-15 20:10:57,219 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-15 20:10:57,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:57,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1837537030, now seen corresponding path program 1 times [2024-09-15 20:10:57,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:57,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914462634] [2024-09-15 20:10:57,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:57,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:57,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:57,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914462634] [2024-09-15 20:10:57,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914462634] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:57,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:57,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:57,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875153043] [2024-09-15 20:10:57,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:57,293 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:57,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:57,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:57,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:57,293 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-15 20:10:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:57,734 INFO L93 Difference]: Finished difference Result 292 states and 376 transitions. [2024-09-15 20:10:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:57,735 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-15 20:10:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:57,736 INFO L225 Difference]: With dead ends: 292 [2024-09-15 20:10:57,736 INFO L226 Difference]: Without dead ends: 292 [2024-09-15 20:10:57,736 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-15 20:10:57,736 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 89 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:57,736 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 192 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 20:10:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-09-15 20:10:57,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 259. [2024-09-15 20:10:57,739 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-15 20:10:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 310 transitions. [2024-09-15 20:10:57,740 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 310 transitions. Word has length 49 [2024-09-15 20:10:57,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:57,740 INFO L474 AbstractCegarLoop]: Abstraction has 259 states and 310 transitions. [2024-09-15 20:10:57,740 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-15 20:10:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 310 transitions. [2024-09-15 20:10:57,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-15 20:10:57,740 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:57,741 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-15 20:10:57,741 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-15 20:10:57,741 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-15 20:10:57,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:57,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1587299458, now seen corresponding path program 1 times [2024-09-15 20:10:57,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:57,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293184518] [2024-09-15 20:10:57,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:57,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293184518] [2024-09-15 20:10:57,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293184518] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:57,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:57,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:57,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632836406] [2024-09-15 20:10:57,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:57,806 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:57,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:57,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:57,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:57,806 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-15 20:10:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:58,125 INFO L93 Difference]: Finished difference Result 290 states and 372 transitions. [2024-09-15 20:10:58,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:58,125 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-15 20:10:58,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:58,126 INFO L225 Difference]: With dead ends: 290 [2024-09-15 20:10:58,126 INFO L226 Difference]: Without dead ends: 290 [2024-09-15 20:10:58,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-15 20:10:58,127 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 86 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:58,127 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 190 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-09-15 20:10:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 258. [2024-09-15 20:10:58,129 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-15 20:10:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 308 transitions. [2024-09-15 20:10:58,130 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 308 transitions. Word has length 52 [2024-09-15 20:10:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:58,130 INFO L474 AbstractCegarLoop]: Abstraction has 258 states and 308 transitions. [2024-09-15 20:10:58,130 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-15 20:10:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 308 transitions. [2024-09-15 20:10:58,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-15 20:10:58,130 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:58,130 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-15 20:10:58,130 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-15 20:10:58,130 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-15 20:10:58,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:58,131 INFO L85 PathProgramCache]: Analyzing trace with hash 351980218, now seen corresponding path program 1 times [2024-09-15 20:10:58,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:58,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448679965] [2024-09-15 20:10:58,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:58,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:58,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:58,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448679965] [2024-09-15 20:10:58,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448679965] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:58,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:58,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:58,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915251808] [2024-09-15 20:10:58,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:58,214 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:58,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:58,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:58,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:58,215 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-15 20:10:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:58,552 INFO L93 Difference]: Finished difference Result 288 states and 368 transitions. [2024-09-15 20:10:58,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:58,552 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-15 20:10:58,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:58,553 INFO L225 Difference]: With dead ends: 288 [2024-09-15 20:10:58,553 INFO L226 Difference]: Without dead ends: 288 [2024-09-15 20:10:58,553 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-15 20:10:58,554 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 86 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:58,554 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 190 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-09-15 20:10:58,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 257. [2024-09-15 20:10:58,556 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-15 20:10:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2024-09-15 20:10:58,557 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 55 [2024-09-15 20:10:58,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:58,557 INFO L474 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2024-09-15 20:10:58,557 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-15 20:10:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2024-09-15 20:10:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-15 20:10:58,558 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:58,558 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-15 20:10:58,558 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-15 20:10:58,559 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-15 20:10:58,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:58,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1827719346, now seen corresponding path program 1 times [2024-09-15 20:10:58,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:58,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971007364] [2024-09-15 20:10:58,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:58,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:58,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:58,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971007364] [2024-09-15 20:10:58,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971007364] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:58,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:58,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:58,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331574185] [2024-09-15 20:10:58,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:58,625 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:58,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:58,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:58,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:58,626 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-15 20:10:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:58,878 INFO L93 Difference]: Finished difference Result 286 states and 364 transitions. [2024-09-15 20:10:58,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:58,879 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-15 20:10:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:58,880 INFO L225 Difference]: With dead ends: 286 [2024-09-15 20:10:58,880 INFO L226 Difference]: Without dead ends: 286 [2024-09-15 20:10:58,880 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-15 20:10:58,880 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 84 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:58,880 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.2s Time] [2024-09-15 20:10:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-09-15 20:10:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 256. [2024-09-15 20:10:58,883 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-15 20:10:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 304 transitions. [2024-09-15 20:10:58,883 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 304 transitions. Word has length 58 [2024-09-15 20:10:58,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:58,883 INFO L474 AbstractCegarLoop]: Abstraction has 256 states and 304 transitions. [2024-09-15 20:10:58,883 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-15 20:10:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 304 transitions. [2024-09-15 20:10:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-15 20:10:58,884 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:58,884 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-15 20:10:58,884 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-15 20:10:58,884 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-15 20:10:58,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:58,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2008117650, now seen corresponding path program 1 times [2024-09-15 20:10:58,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:58,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587070174] [2024-09-15 20:10:58,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:58,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:58,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:58,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587070174] [2024-09-15 20:10:58,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587070174] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:58,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:58,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:58,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138661646] [2024-09-15 20:10:58,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:58,953 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:58,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:58,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:58,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:58,954 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-15 20:10:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:59,243 INFO L93 Difference]: Finished difference Result 284 states and 360 transitions. [2024-09-15 20:10:59,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:59,243 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-15 20:10:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:59,244 INFO L225 Difference]: With dead ends: 284 [2024-09-15 20:10:59,244 INFO L226 Difference]: Without dead ends: 284 [2024-09-15 20:10:59,244 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-15 20:10:59,245 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 79 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:59,245 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 190 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:10:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-09-15 20:10:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 255. [2024-09-15 20:10:59,247 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-15 20:10:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 302 transitions. [2024-09-15 20:10:59,248 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 302 transitions. Word has length 61 [2024-09-15 20:10:59,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:59,248 INFO L474 AbstractCegarLoop]: Abstraction has 255 states and 302 transitions. [2024-09-15 20:10:59,248 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-15 20:10:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 302 transitions. [2024-09-15 20:10:59,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-09-15 20:10:59,248 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:59,248 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-15 20:10:59,248 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-15 20:10:59,249 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-15 20:10:59,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:59,249 INFO L85 PathProgramCache]: Analyzing trace with hash 766789094, now seen corresponding path program 1 times [2024-09-15 20:10:59,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:59,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872905607] [2024-09-15 20:10:59,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:59,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:59,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872905607] [2024-09-15 20:10:59,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872905607] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:59,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:59,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:59,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666784639] [2024-09-15 20:10:59,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:59,307 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:59,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:59,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:59,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:59,308 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-15 20:10:59,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:59,619 INFO L93 Difference]: Finished difference Result 282 states and 356 transitions. [2024-09-15 20:10:59,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:10:59,620 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-15 20:10:59,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:59,620 INFO L225 Difference]: With dead ends: 282 [2024-09-15 20:10:59,621 INFO L226 Difference]: Without dead ends: 282 [2024-09-15 20:10:59,621 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-15 20:10:59,621 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-15 20:10:59,621 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-15 20:10:59,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-09-15 20:10:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 254. [2024-09-15 20:10:59,624 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-15 20:10:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 300 transitions. [2024-09-15 20:10:59,625 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 300 transitions. Word has length 64 [2024-09-15 20:10:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:59,625 INFO L474 AbstractCegarLoop]: Abstraction has 254 states and 300 transitions. [2024-09-15 20:10:59,625 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-15 20:10:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 300 transitions. [2024-09-15 20:10:59,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-15 20:10:59,625 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:59,626 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-15 20:10:59,626 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-15 20:10:59,626 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-15 20:10:59,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:59,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1516903902, now seen corresponding path program 1 times [2024-09-15 20:10:59,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:59,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850818518] [2024-09-15 20:10:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:59,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:59,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:59,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850818518] [2024-09-15 20:10:59,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850818518] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:59,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:59,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:59,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874298995] [2024-09-15 20:10:59,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:59,699 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:10:59,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:59,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:10:59,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:10:59,699 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-15 20:11:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:00,061 INFO L93 Difference]: Finished difference Result 280 states and 352 transitions. [2024-09-15 20:11:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:00,063 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-15 20:11:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:00,064 INFO L225 Difference]: With dead ends: 280 [2024-09-15 20:11:00,064 INFO L226 Difference]: Without dead ends: 280 [2024-09-15 20:11:00,064 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-15 20:11:00,065 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-15 20:11:00,065 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-15 20:11:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-09-15 20:11:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 253. [2024-09-15 20:11:00,067 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-15 20:11:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 298 transitions. [2024-09-15 20:11:00,067 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 298 transitions. Word has length 67 [2024-09-15 20:11:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:00,068 INFO L474 AbstractCegarLoop]: Abstraction has 253 states and 298 transitions. [2024-09-15 20:11:00,068 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-15 20:11:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 298 transitions. [2024-09-15 20:11:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-15 20:11:00,068 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:00,068 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-15 20:11:00,068 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-15 20:11:00,069 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-15 20:11:00,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:00,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1561998108, now seen corresponding path program 1 times [2024-09-15 20:11:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:00,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15541809] [2024-09-15 20:11:00,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:00,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:00,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:00,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15541809] [2024-09-15 20:11:00,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15541809] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:00,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:00,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:00,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430526879] [2024-09-15 20:11:00,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:00,138 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:00,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:00,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:00,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:00,139 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-15 20:11:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:00,551 INFO L93 Difference]: Finished difference Result 278 states and 348 transitions. [2024-09-15 20:11:00,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:00,551 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-15 20:11:00,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:00,552 INFO L225 Difference]: With dead ends: 278 [2024-09-15 20:11:00,552 INFO L226 Difference]: Without dead ends: 278 [2024-09-15 20:11:00,552 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-15 20:11:00,553 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 72 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:00,553 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.4s Time] [2024-09-15 20:11:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-09-15 20:11:00,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 252. [2024-09-15 20:11:00,556 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-15 20:11:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 296 transitions. [2024-09-15 20:11:00,556 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 296 transitions. Word has length 70 [2024-09-15 20:11:00,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:00,556 INFO L474 AbstractCegarLoop]: Abstraction has 252 states and 296 transitions. [2024-09-15 20:11:00,557 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-15 20:11:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 296 transitions. [2024-09-15 20:11:00,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-15 20:11:00,557 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:00,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] [2024-09-15 20:11:00,557 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-15 20:11:00,557 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-15 20:11:00,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1810214548, now seen corresponding path program 1 times [2024-09-15 20:11:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:00,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885890174] [2024-09-15 20:11:00,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,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-15 20:11:00,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:00,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885890174] [2024-09-15 20:11:00,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885890174] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:00,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:00,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:00,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012958726] [2024-09-15 20:11:00,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:00,630 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:00,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:00,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:00,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:00,631 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-15 20:11:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:00,878 INFO L93 Difference]: Finished difference Result 276 states and 344 transitions. [2024-09-15 20:11:00,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:00,878 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-15 20:11:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:00,879 INFO L225 Difference]: With dead ends: 276 [2024-09-15 20:11:00,879 INFO L226 Difference]: Without dead ends: 276 [2024-09-15 20:11:00,879 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-15 20:11:00,880 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 71 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:00,880 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.2s Time] [2024-09-15 20:11:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-09-15 20:11:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 251. [2024-09-15 20:11:00,886 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-15 20:11:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 294 transitions. [2024-09-15 20:11:00,886 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 294 transitions. Word has length 73 [2024-09-15 20:11:00,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:00,886 INFO L474 AbstractCegarLoop]: Abstraction has 251 states and 294 transitions. [2024-09-15 20:11:00,887 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-15 20:11:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 294 transitions. [2024-09-15 20:11:00,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-09-15 20:11:00,887 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:00,887 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-15 20:11:00,887 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-09-15 20:11:00,887 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-15 20:11:00,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash 492504784, now seen corresponding path program 1 times [2024-09-15 20:11:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:00,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6101618] [2024-09-15 20:11:00,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:00,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:00,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:00,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6101618] [2024-09-15 20:11:00,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6101618] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:00,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:00,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:00,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629887655] [2024-09-15 20:11:00,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:00,963 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:00,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:00,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:00,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:00,964 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-15 20:11:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:01,246 INFO L93 Difference]: Finished difference Result 274 states and 340 transitions. [2024-09-15 20:11:01,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:01,246 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-15 20:11:01,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:01,247 INFO L225 Difference]: With dead ends: 274 [2024-09-15 20:11:01,247 INFO L226 Difference]: Without dead ends: 274 [2024-09-15 20:11:01,247 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:01,248 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 68 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:01,248 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-15 20:11:01,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-09-15 20:11:01,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 250. [2024-09-15 20:11:01,250 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-15 20:11:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 292 transitions. [2024-09-15 20:11:01,251 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 292 transitions. Word has length 76 [2024-09-15 20:11:01,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:01,251 INFO L474 AbstractCegarLoop]: Abstraction has 250 states and 292 transitions. [2024-09-15 20:11:01,251 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-15 20:11:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 292 transitions. [2024-09-15 20:11:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-09-15 20:11:01,252 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:01,252 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:01,252 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-09-15 20:11:01,252 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-15 20:11:01,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:01,252 INFO L85 PathProgramCache]: Analyzing trace with hash 602020942, now seen corresponding path program 1 times [2024-09-15 20:11:01,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:01,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170217336] [2024-09-15 20:11:01,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:01,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:01,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:01,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170217336] [2024-09-15 20:11:01,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170217336] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:01,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:01,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:01,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072998567] [2024-09-15 20:11:01,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:01,317 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:01,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:01,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:01,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:01,318 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-15 20:11:01,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:01,611 INFO L93 Difference]: Finished difference Result 272 states and 336 transitions. [2024-09-15 20:11:01,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:01,611 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-15 20:11:01,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:01,612 INFO L225 Difference]: With dead ends: 272 [2024-09-15 20:11:01,612 INFO L226 Difference]: Without dead ends: 272 [2024-09-15 20:11:01,612 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-15 20:11:01,612 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 64 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:01,612 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 190 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:11:01,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-09-15 20:11:01,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 249. [2024-09-15 20:11:01,614 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-15 20:11:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 290 transitions. [2024-09-15 20:11:01,615 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 290 transitions. Word has length 79 [2024-09-15 20:11:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:01,615 INFO L474 AbstractCegarLoop]: Abstraction has 249 states and 290 transitions. [2024-09-15 20:11:01,615 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-15 20:11:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 290 transitions. [2024-09-15 20:11:01,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-15 20:11:01,616 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:01,616 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-15 20:11:01,616 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-09-15 20:11:01,616 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-15 20:11:01,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:01,616 INFO L85 PathProgramCache]: Analyzing trace with hash -977251132, now seen corresponding path program 1 times [2024-09-15 20:11:01,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:01,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616141256] [2024-09-15 20:11:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:01,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:01,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:01,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616141256] [2024-09-15 20:11:01,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616141256] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:01,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:01,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:01,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587295668] [2024-09-15 20:11:01,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:01,677 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:01,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:01,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:01,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:01,678 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-15 20:11:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:01,928 INFO L93 Difference]: Finished difference Result 270 states and 332 transitions. [2024-09-15 20:11:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:01,928 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-15 20:11:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:01,929 INFO L225 Difference]: With dead ends: 270 [2024-09-15 20:11:01,929 INFO L226 Difference]: Without dead ends: 270 [2024-09-15 20:11:01,929 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:01,930 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 64 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:01,930 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 188 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:01,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-09-15 20:11:01,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 248. [2024-09-15 20:11:01,932 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-15 20:11:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 288 transitions. [2024-09-15 20:11:01,932 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 288 transitions. Word has length 82 [2024-09-15 20:11:01,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:01,933 INFO L474 AbstractCegarLoop]: Abstraction has 248 states and 288 transitions. [2024-09-15 20:11:01,933 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-15 20:11:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 288 transitions. [2024-09-15 20:11:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-15 20:11:01,933 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:01,934 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:01,934 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-09-15 20:11:01,934 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-15 20:11:01,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1999837374, now seen corresponding path program 1 times [2024-09-15 20:11:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:01,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725382957] [2024-09-15 20:11:01,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:02,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:02,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725382957] [2024-09-15 20:11:02,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725382957] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:02,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:02,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:02,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27380240] [2024-09-15 20:11:02,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:02,003 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:02,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:02,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:02,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:02,004 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-15 20:11:02,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:02,283 INFO L93 Difference]: Finished difference Result 268 states and 328 transitions. [2024-09-15 20:11:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:02,283 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-15 20:11:02,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:02,284 INFO L225 Difference]: With dead ends: 268 [2024-09-15 20:11:02,284 INFO L226 Difference]: Without dead ends: 268 [2024-09-15 20:11:02,284 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-15 20:11:02,284 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 61 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:02,284 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-15 20:11:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-09-15 20:11:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 247. [2024-09-15 20:11:02,287 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-15 20:11:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 286 transitions. [2024-09-15 20:11:02,288 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 286 transitions. Word has length 85 [2024-09-15 20:11:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:02,288 INFO L474 AbstractCegarLoop]: Abstraction has 247 states and 286 transitions. [2024-09-15 20:11:02,288 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-15 20:11:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 286 transitions. [2024-09-15 20:11:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-09-15 20:11:02,289 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:02,289 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-15 20:11:02,289 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-09-15 20:11:02,289 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-15 20:11:02,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:02,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1663532360, now seen corresponding path program 1 times [2024-09-15 20:11:02,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:02,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683110997] [2024-09-15 20:11:02,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:02,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,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-15 20:11:02,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683110997] [2024-09-15 20:11:02,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683110997] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:02,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:02,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:02,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032396396] [2024-09-15 20:11:02,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:02,357 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:02,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:02,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:02,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:02,357 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-15 20:11:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:02,647 INFO L93 Difference]: Finished difference Result 266 states and 324 transitions. [2024-09-15 20:11:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:02,648 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-15 20:11:02,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:02,649 INFO L225 Difference]: With dead ends: 266 [2024-09-15 20:11:02,649 INFO L226 Difference]: Without dead ends: 266 [2024-09-15 20:11:02,649 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-15 20:11:02,652 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 59 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:02,652 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-15 20:11:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-09-15 20:11:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 246. [2024-09-15 20:11:02,654 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-15 20:11:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 284 transitions. [2024-09-15 20:11:02,655 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 284 transitions. Word has length 88 [2024-09-15 20:11:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:02,655 INFO L474 AbstractCegarLoop]: Abstraction has 246 states and 284 transitions. [2024-09-15 20:11:02,655 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-15 20:11:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 284 transitions. [2024-09-15 20:11:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-09-15 20:11:02,656 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:02,656 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-15 20:11:02,656 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-09-15 20:11:02,656 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-15 20:11:02,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:02,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1335415350, now seen corresponding path program 1 times [2024-09-15 20:11:02,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:02,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51318674] [2024-09-15 20:11:02,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:02,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:02,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:02,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51318674] [2024-09-15 20:11:02,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51318674] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:02,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:02,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:02,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166750431] [2024-09-15 20:11:02,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:02,724 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:02,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:02,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:02,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:02,724 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-15 20:11:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:03,001 INFO L93 Difference]: Finished difference Result 264 states and 320 transitions. [2024-09-15 20:11:03,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:03,002 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-15 20:11:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:03,003 INFO L225 Difference]: With dead ends: 264 [2024-09-15 20:11:03,003 INFO L226 Difference]: Without dead ends: 264 [2024-09-15 20:11:03,003 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-15 20:11:03,003 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 56 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:03,003 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-15 20:11:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-09-15 20:11:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 245. [2024-09-15 20:11:03,005 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-15 20:11:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 282 transitions. [2024-09-15 20:11:03,010 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 282 transitions. Word has length 91 [2024-09-15 20:11:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:03,010 INFO L474 AbstractCegarLoop]: Abstraction has 245 states and 282 transitions. [2024-09-15 20:11:03,010 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-15 20:11:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 282 transitions. [2024-09-15 20:11:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-09-15 20:11:03,011 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:03,011 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-15 20:11:03,011 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-09-15 20:11:03,011 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-15 20:11:03,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash -923037524, now seen corresponding path program 1 times [2024-09-15 20:11:03,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:03,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145252215] [2024-09-15 20:11:03,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:03,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:03,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:03,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145252215] [2024-09-15 20:11:03,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145252215] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:03,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:03,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:03,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73771228] [2024-09-15 20:11:03,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:03,080 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:03,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:03,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:03,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:03,081 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-15 20:11:03,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:03,377 INFO L93 Difference]: Finished difference Result 262 states and 316 transitions. [2024-09-15 20:11:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:03,377 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-15 20:11:03,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:03,378 INFO L225 Difference]: With dead ends: 262 [2024-09-15 20:11:03,378 INFO L226 Difference]: Without dead ends: 262 [2024-09-15 20:11:03,378 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-15 20:11:03,379 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 52 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:03,379 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 192 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:11:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-09-15 20:11:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 244. [2024-09-15 20:11:03,381 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-15 20:11:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 280 transitions. [2024-09-15 20:11:03,381 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 280 transitions. Word has length 94 [2024-09-15 20:11:03,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:03,381 INFO L474 AbstractCegarLoop]: Abstraction has 244 states and 280 transitions. [2024-09-15 20:11:03,381 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-15 20:11:03,382 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 280 transitions. [2024-09-15 20:11:03,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-09-15 20:11:03,382 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:03,382 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-15 20:11:03,382 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-09-15 20:11:03,382 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-15 20:11:03,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:03,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1829905110, now seen corresponding path program 1 times [2024-09-15 20:11:03,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:03,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372721319] [2024-09-15 20:11:03,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:03,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:03,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:03,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372721319] [2024-09-15 20:11:03,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372721319] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:03,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:03,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:03,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859146576] [2024-09-15 20:11:03,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:03,466 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:03,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:03,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:03,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:03,467 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-15 20:11:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:03,745 INFO L93 Difference]: Finished difference Result 260 states and 312 transitions. [2024-09-15 20:11:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:03,745 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-15 20:11:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:03,746 INFO L225 Difference]: With dead ends: 260 [2024-09-15 20:11:03,746 INFO L226 Difference]: Without dead ends: 260 [2024-09-15 20:11:03,747 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-15 20:11:03,748 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-15 20:11:03,748 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-15 20:11:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-09-15 20:11:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 243. [2024-09-15 20:11:03,751 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-15 20:11:03,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 278 transitions. [2024-09-15 20:11:03,752 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 278 transitions. Word has length 97 [2024-09-15 20:11:03,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:03,752 INFO L474 AbstractCegarLoop]: Abstraction has 243 states and 278 transitions. [2024-09-15 20:11:03,753 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-15 20:11:03,753 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 278 transitions. [2024-09-15 20:11:03,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-09-15 20:11:03,753 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:03,753 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:03,753 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-09-15 20:11:03,753 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-15 20:11:03,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:03,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1317109408, now seen corresponding path program 1 times [2024-09-15 20:11:03,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:03,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799948905] [2024-09-15 20:11:03,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:03,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:03,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:03,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799948905] [2024-09-15 20:11:03,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799948905] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:03,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:03,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:03,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835203762] [2024-09-15 20:11:03,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:03,824 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:03,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:03,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:03,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:03,825 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-15 20:11:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:04,141 INFO L93 Difference]: Finished difference Result 258 states and 308 transitions. [2024-09-15 20:11:04,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:04,142 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-15 20:11:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:04,142 INFO L225 Difference]: With dead ends: 258 [2024-09-15 20:11:04,142 INFO L226 Difference]: Without dead ends: 258 [2024-09-15 20:11:04,143 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-15 20:11:04,143 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-15 20:11:04,143 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-15 20:11:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-09-15 20:11:04,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 242. [2024-09-15 20:11:04,145 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-15 20:11:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 276 transitions. [2024-09-15 20:11:04,146 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 276 transitions. Word has length 100 [2024-09-15 20:11:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:04,146 INFO L474 AbstractCegarLoop]: Abstraction has 242 states and 276 transitions. [2024-09-15 20:11:04,146 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-15 20:11:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 276 transitions. [2024-09-15 20:11:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-09-15 20:11:04,146 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:04,146 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-15 20:11:04,147 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-09-15 20:11:04,147 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-15 20:11:04,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:04,147 INFO L85 PathProgramCache]: Analyzing trace with hash -814479328, now seen corresponding path program 1 times [2024-09-15 20:11:04,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:04,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809535054] [2024-09-15 20:11:04,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:04,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:04,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:04,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809535054] [2024-09-15 20:11:04,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809535054] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:04,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:04,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:04,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246571043] [2024-09-15 20:11:04,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:04,211 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:04,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:04,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:04,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:04,212 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-15 20:11:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:04,429 INFO L93 Difference]: Finished difference Result 256 states and 304 transitions. [2024-09-15 20:11:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:04,429 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-15 20:11:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:04,430 INFO L225 Difference]: With dead ends: 256 [2024-09-15 20:11:04,430 INFO L226 Difference]: Without dead ends: 256 [2024-09-15 20:11:04,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-15 20:11:04,430 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 46 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:04,430 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 188 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:04,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-09-15 20:11:04,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 241. [2024-09-15 20:11:04,432 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-15 20:11:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 274 transitions. [2024-09-15 20:11:04,433 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 274 transitions. Word has length 103 [2024-09-15 20:11:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:04,433 INFO L474 AbstractCegarLoop]: Abstraction has 241 states and 274 transitions. [2024-09-15 20:11:04,433 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-15 20:11:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 274 transitions. [2024-09-15 20:11:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-09-15 20:11:04,433 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:04,434 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-15 20:11:04,434 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-09-15 20:11:04,434 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-15 20:11:04,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:04,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1883032238, now seen corresponding path program 1 times [2024-09-15 20:11:04,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:04,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696442978] [2024-09-15 20:11:04,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:04,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,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-15 20:11:04,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696442978] [2024-09-15 20:11:04,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696442978] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:04,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:04,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:04,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571884282] [2024-09-15 20:11:04,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:04,511 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:04,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:04,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:04,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:04,512 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-15 20:11:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:04,742 INFO L93 Difference]: Finished difference Result 254 states and 300 transitions. [2024-09-15 20:11:04,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:04,743 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-15 20:11:04,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:04,743 INFO L225 Difference]: With dead ends: 254 [2024-09-15 20:11:04,743 INFO L226 Difference]: Without dead ends: 254 [2024-09-15 20:11:04,744 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-15 20:11:04,744 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 44 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:04,744 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 188 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:04,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-09-15 20:11:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2024-09-15 20:11:04,746 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-15 20:11:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 272 transitions. [2024-09-15 20:11:04,748 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 272 transitions. Word has length 106 [2024-09-15 20:11:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:04,749 INFO L474 AbstractCegarLoop]: Abstraction has 240 states and 272 transitions. [2024-09-15 20:11:04,749 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-15 20:11:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 272 transitions. [2024-09-15 20:11:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-09-15 20:11:04,749 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:04,749 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-15 20:11:04,749 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-09-15 20:11:04,750 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-15 20:11:04,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:04,750 INFO L85 PathProgramCache]: Analyzing trace with hash -845166188, now seen corresponding path program 1 times [2024-09-15 20:11:04,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:04,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377955812] [2024-09-15 20:11:04,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:04,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:04,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:04,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377955812] [2024-09-15 20:11:04,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377955812] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:04,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:04,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462099240] [2024-09-15 20:11:04,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:04,820 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:04,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:04,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:04,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:04,820 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-15 20:11:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:05,092 INFO L93 Difference]: Finished difference Result 252 states and 296 transitions. [2024-09-15 20:11:05,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:05,092 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-15 20:11:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:05,093 INFO L225 Difference]: With dead ends: 252 [2024-09-15 20:11:05,093 INFO L226 Difference]: Without dead ends: 252 [2024-09-15 20:11:05,093 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-15 20:11:05,093 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 39 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:05,093 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 192 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:11:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-09-15 20:11:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 239. [2024-09-15 20:11:05,095 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-15 20:11:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 270 transitions. [2024-09-15 20:11:05,096 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 270 transitions. Word has length 109 [2024-09-15 20:11:05,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:05,096 INFO L474 AbstractCegarLoop]: Abstraction has 239 states and 270 transitions. [2024-09-15 20:11:05,096 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-15 20:11:05,096 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 270 transitions. [2024-09-15 20:11:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-09-15 20:11:05,096 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:05,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] [2024-09-15 20:11:05,096 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-09-15 20:11:05,096 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-15 20:11:05,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:05,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1247224500, now seen corresponding path program 1 times [2024-09-15 20:11:05,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:05,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365841774] [2024-09-15 20:11:05,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:05,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:05,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:05,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365841774] [2024-09-15 20:11:05,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365841774] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:05,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:05,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:05,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072010665] [2024-09-15 20:11:05,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:05,166 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:05,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:05,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:05,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:05,167 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-15 20:11:05,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:05,409 INFO L93 Difference]: Finished difference Result 250 states and 292 transitions. [2024-09-15 20:11:05,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:05,409 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-15 20:11:05,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:05,410 INFO L225 Difference]: With dead ends: 250 [2024-09-15 20:11:05,410 INFO L226 Difference]: Without dead ends: 250 [2024-09-15 20:11:05,410 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-15 20:11:05,411 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 37 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:05,411 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 190 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-09-15 20:11:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2024-09-15 20:11:05,413 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-15 20:11:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 268 transitions. [2024-09-15 20:11:05,413 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 268 transitions. Word has length 112 [2024-09-15 20:11:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:05,413 INFO L474 AbstractCegarLoop]: Abstraction has 238 states and 268 transitions. [2024-09-15 20:11:05,413 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-15 20:11:05,414 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 268 transitions. [2024-09-15 20:11:05,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-15 20:11:05,414 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:05,414 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-09-15 20:11:05,414 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-15 20:11:05,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:05,414 INFO L85 PathProgramCache]: Analyzing trace with hash -302598840, now seen corresponding path program 1 times [2024-09-15 20:11:05,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:05,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230516451] [2024-09-15 20:11:05,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:05,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:05,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:05,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:05,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230516451] [2024-09-15 20:11:05,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230516451] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:05,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:05,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:05,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803101615] [2024-09-15 20:11:05,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:05,487 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:05,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:05,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:05,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:05,487 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-15 20:11:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:05,716 INFO L93 Difference]: Finished difference Result 248 states and 288 transitions. [2024-09-15 20:11:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:05,716 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-15 20:11:05,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:05,717 INFO L225 Difference]: With dead ends: 248 [2024-09-15 20:11:05,717 INFO L226 Difference]: Without dead ends: 248 [2024-09-15 20:11:05,717 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-15 20:11:05,717 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 36 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:05,717 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 190 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-09-15 20:11:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 237. [2024-09-15 20:11:05,719 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-15 20:11:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 266 transitions. [2024-09-15 20:11:05,720 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 266 transitions. Word has length 115 [2024-09-15 20:11:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:05,720 INFO L474 AbstractCegarLoop]: Abstraction has 237 states and 266 transitions. [2024-09-15 20:11:05,720 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-15 20:11:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 266 transitions. [2024-09-15 20:11:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-09-15 20:11:05,720 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:05,720 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-15 20:11:05,720 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-09-15 20:11:05,720 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-15 20:11:05,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:05,721 INFO L85 PathProgramCache]: Analyzing trace with hash 414724736, now seen corresponding path program 1 times [2024-09-15 20:11:05,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:05,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074917783] [2024-09-15 20:11:05,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:05,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:05,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-15 20:11:05,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:05,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074917783] [2024-09-15 20:11:05,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074917783] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:05,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:05,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:05,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350619551] [2024-09-15 20:11:05,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:05,799 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:05,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:05,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:05,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:05,799 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-15 20:11:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:06,039 INFO L93 Difference]: Finished difference Result 246 states and 284 transitions. [2024-09-15 20:11:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:06,039 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-15 20:11:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:06,040 INFO L225 Difference]: With dead ends: 246 [2024-09-15 20:11:06,040 INFO L226 Difference]: Without dead ends: 246 [2024-09-15 20:11:06,040 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:06,040 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 32 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:06,040 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 190 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:06,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-09-15 20:11:06,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 236. [2024-09-15 20:11:06,043 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-15 20:11:06,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 264 transitions. [2024-09-15 20:11:06,044 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 264 transitions. Word has length 118 [2024-09-15 20:11:06,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:06,044 INFO L474 AbstractCegarLoop]: Abstraction has 236 states and 264 transitions. [2024-09-15 20:11:06,044 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-15 20:11:06,044 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 264 transitions. [2024-09-15 20:11:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-09-15 20:11:06,044 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:06,044 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-15 20:11:06,044 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-09-15 20:11:06,045 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-15 20:11:06,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1555877636, now seen corresponding path program 1 times [2024-09-15 20:11:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:06,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833497416] [2024-09-15 20:11:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:06,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:06,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833497416] [2024-09-15 20:11:06,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833497416] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:06,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:06,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:06,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017773102] [2024-09-15 20:11:06,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:06,133 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:06,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:06,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:06,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:06,133 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-15 20:11:06,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:06,370 INFO L93 Difference]: Finished difference Result 244 states and 280 transitions. [2024-09-15 20:11:06,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:06,370 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-15 20:11:06,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:06,371 INFO L225 Difference]: With dead ends: 244 [2024-09-15 20:11:06,371 INFO L226 Difference]: Without dead ends: 244 [2024-09-15 20:11:06,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-15 20:11:06,371 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 29 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:06,372 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 190 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:06,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-09-15 20:11:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 235. [2024-09-15 20:11:06,373 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-15 20:11:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 262 transitions. [2024-09-15 20:11:06,374 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 262 transitions. Word has length 121 [2024-09-15 20:11:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:06,374 INFO L474 AbstractCegarLoop]: Abstraction has 235 states and 262 transitions. [2024-09-15 20:11:06,374 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-15 20:11:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 262 transitions. [2024-09-15 20:11:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-09-15 20:11:06,375 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:06,375 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-15 20:11:06,375 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-09-15 20:11:06,375 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-15 20:11:06,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:06,376 INFO L85 PathProgramCache]: Analyzing trace with hash 136837044, now seen corresponding path program 1 times [2024-09-15 20:11:06,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:06,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898910955] [2024-09-15 20:11:06,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:06,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:06,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:06,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898910955] [2024-09-15 20:11:06,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898910955] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:06,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:06,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:06,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890741125] [2024-09-15 20:11:06,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:06,464 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:06,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:06,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:06,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:06,465 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-15 20:11:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:06,665 INFO L93 Difference]: Finished difference Result 242 states and 276 transitions. [2024-09-15 20:11:06,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:06,665 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-15 20:11:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:06,666 INFO L225 Difference]: With dead ends: 242 [2024-09-15 20:11:06,666 INFO L226 Difference]: Without dead ends: 242 [2024-09-15 20:11:06,666 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-15 20:11:06,666 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-15 20:11:06,666 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-15 20:11:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-09-15 20:11:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 234. [2024-09-15 20:11:06,668 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-15 20:11:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 260 transitions. [2024-09-15 20:11:06,668 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 260 transitions. Word has length 124 [2024-09-15 20:11:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:06,669 INFO L474 AbstractCegarLoop]: Abstraction has 234 states and 260 transitions. [2024-09-15 20:11:06,669 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-15 20:11:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 260 transitions. [2024-09-15 20:11:06,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-09-15 20:11:06,669 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:06,669 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-15 20:11:06,669 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-09-15 20:11:06,669 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-15 20:11:06,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:06,669 INFO L85 PathProgramCache]: Analyzing trace with hash 588856496, now seen corresponding path program 1 times [2024-09-15 20:11:06,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:06,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547500037] [2024-09-15 20:11:06,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:06,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:06,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:06,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547500037] [2024-09-15 20:11:06,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547500037] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:06,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:06,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:06,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240109062] [2024-09-15 20:11:06,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:06,765 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:06,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:06,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:06,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:06,765 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-15 20:11:06,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:06,994 INFO L93 Difference]: Finished difference Result 240 states and 272 transitions. [2024-09-15 20:11:06,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:06,994 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-15 20:11:06,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:06,995 INFO L225 Difference]: With dead ends: 240 [2024-09-15 20:11:06,995 INFO L226 Difference]: Without dead ends: 240 [2024-09-15 20:11:06,995 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-15 20:11:06,995 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 26 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:06,995 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 190 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-09-15 20:11:06,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 233. [2024-09-15 20:11:06,997 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-15 20:11:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 258 transitions. [2024-09-15 20:11:06,997 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 258 transitions. Word has length 127 [2024-09-15 20:11:06,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:06,998 INFO L474 AbstractCegarLoop]: Abstraction has 233 states and 258 transitions. [2024-09-15 20:11:06,998 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-15 20:11:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 258 transitions. [2024-09-15 20:11:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-09-15 20:11:06,998 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:06,998 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-15 20:11:06,998 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-09-15 20:11:06,998 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-15 20:11:06,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1977887976, now seen corresponding path program 1 times [2024-09-15 20:11:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:06,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276385123] [2024-09-15 20:11:06,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:06,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:07,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:07,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276385123] [2024-09-15 20:11:07,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276385123] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:07,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:07,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:07,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724250343] [2024-09-15 20:11:07,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:07,096 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:07,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:07,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:07,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:07,097 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-15 20:11:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:07,295 INFO L93 Difference]: Finished difference Result 238 states and 268 transitions. [2024-09-15 20:11:07,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:07,296 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-15 20:11:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:07,296 INFO L225 Difference]: With dead ends: 238 [2024-09-15 20:11:07,296 INFO L226 Difference]: Without dead ends: 238 [2024-09-15 20:11:07,296 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:07,297 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-15 20:11:07,297 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-15 20:11:07,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-09-15 20:11:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 232. [2024-09-15 20:11:07,299 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-15 20:11:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 256 transitions. [2024-09-15 20:11:07,299 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 256 transitions. Word has length 130 [2024-09-15 20:11:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:07,299 INFO L474 AbstractCegarLoop]: Abstraction has 232 states and 256 transitions. [2024-09-15 20:11:07,299 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-15 20:11:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 256 transitions. [2024-09-15 20:11:07,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-09-15 20:11:07,300 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:07,300 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-15 20:11:07,300 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-09-15 20:11:07,300 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-15 20:11:07,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:07,300 INFO L85 PathProgramCache]: Analyzing trace with hash 604821604, now seen corresponding path program 1 times [2024-09-15 20:11:07,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:07,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122314231] [2024-09-15 20:11:07,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:07,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:07,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:07,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122314231] [2024-09-15 20:11:07,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122314231] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:07,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:07,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:07,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305656787] [2024-09-15 20:11:07,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:07,382 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:07,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:07,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:07,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:07,383 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-15 20:11:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:07,626 INFO L93 Difference]: Finished difference Result 236 states and 264 transitions. [2024-09-15 20:11:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:07,627 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-15 20:11:07,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:07,627 INFO L225 Difference]: With dead ends: 236 [2024-09-15 20:11:07,627 INFO L226 Difference]: Without dead ends: 236 [2024-09-15 20:11:07,628 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-15 20:11:07,628 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 19 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:07,628 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 192 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-09-15 20:11:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 231. [2024-09-15 20:11:07,630 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-15 20:11:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 254 transitions. [2024-09-15 20:11:07,630 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 254 transitions. Word has length 133 [2024-09-15 20:11:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:07,630 INFO L474 AbstractCegarLoop]: Abstraction has 231 states and 254 transitions. [2024-09-15 20:11:07,630 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-15 20:11:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 254 transitions. [2024-09-15 20:11:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-09-15 20:11:07,631 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:07,631 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-15 20:11:07,631 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-09-15 20:11:07,631 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-15 20:11:07,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:07,631 INFO L85 PathProgramCache]: Analyzing trace with hash 853070366, now seen corresponding path program 1 times [2024-09-15 20:11:07,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:07,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056527622] [2024-09-15 20:11:07,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:07,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:07,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:07,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056527622] [2024-09-15 20:11:07,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056527622] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:07,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:07,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:07,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556632595] [2024-09-15 20:11:07,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:07,711 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:07,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:07,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:07,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:07,712 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-15 20:11:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:07,887 INFO L93 Difference]: Finished difference Result 234 states and 260 transitions. [2024-09-15 20:11:07,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:07,887 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-15 20:11:07,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:07,888 INFO L225 Difference]: With dead ends: 234 [2024-09-15 20:11:07,888 INFO L226 Difference]: Without dead ends: 234 [2024-09-15 20:11:07,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-15 20:11:07,888 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 19 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:07,889 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 188 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:07,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-09-15 20:11:07,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2024-09-15 20:11:07,890 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-15 20:11:07,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2024-09-15 20:11:07,890 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 136 [2024-09-15 20:11:07,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:07,891 INFO L474 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2024-09-15 20:11:07,891 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-15 20:11:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2024-09-15 20:11:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-09-15 20:11:07,891 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:07,891 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-15 20:11:07,891 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-09-15 20:11:07,891 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-15 20:11:07,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:07,892 INFO L85 PathProgramCache]: Analyzing trace with hash 498265302, now seen corresponding path program 1 times [2024-09-15 20:11:07,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:07,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137611357] [2024-09-15 20:11:07,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:07,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:07,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:07,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137611357] [2024-09-15 20:11:07,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137611357] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:07,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:07,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:07,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81245083] [2024-09-15 20:11:07,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:07,974 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:07,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:07,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:07,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:07,975 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-15 20:11:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:08,154 INFO L93 Difference]: Finished difference Result 232 states and 256 transitions. [2024-09-15 20:11:08,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:08,154 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-15 20:11:08,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:08,155 INFO L225 Difference]: With dead ends: 232 [2024-09-15 20:11:08,155 INFO L226 Difference]: Without dead ends: 232 [2024-09-15 20:11:08,155 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-15 20:11:08,155 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 16 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:08,155 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-15 20:11:08,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-09-15 20:11:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2024-09-15 20:11:08,157 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-15 20:11:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 250 transitions. [2024-09-15 20:11:08,157 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 250 transitions. Word has length 139 [2024-09-15 20:11:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:08,157 INFO L474 AbstractCegarLoop]: Abstraction has 229 states and 250 transitions. [2024-09-15 20:11:08,157 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-15 20:11:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 250 transitions. [2024-09-15 20:11:08,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-09-15 20:11:08,158 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:08,158 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-15 20:11:08,158 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-09-15 20:11:08,158 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-15 20:11:08,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:08,158 INFO L85 PathProgramCache]: Analyzing trace with hash 415129042, now seen corresponding path program 1 times [2024-09-15 20:11:08,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:08,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190427314] [2024-09-15 20:11:08,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:08,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:08,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190427314] [2024-09-15 20:11:08,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190427314] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:08,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:08,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:08,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064797247] [2024-09-15 20:11:08,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:08,245 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:08,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:08,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:08,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:08,245 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-15 20:11:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:08,495 INFO L93 Difference]: Finished difference Result 230 states and 252 transitions. [2024-09-15 20:11:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:08,496 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-15 20:11:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:08,496 INFO L225 Difference]: With dead ends: 230 [2024-09-15 20:11:08,496 INFO L226 Difference]: Without dead ends: 230 [2024-09-15 20:11:08,497 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:08,497 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 12 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:08,497 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 192 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-09-15 20:11:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2024-09-15 20:11:08,499 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-15 20:11:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2024-09-15 20:11:08,499 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 142 [2024-09-15 20:11:08,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:08,499 INFO L474 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2024-09-15 20:11:08,499 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-15 20:11:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2024-09-15 20:11:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-09-15 20:11:08,500 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:08,500 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-15 20:11:08,500 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-09-15 20:11:08,500 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-15 20:11:08,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:08,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1898947216, now seen corresponding path program 1 times [2024-09-15 20:11:08,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:08,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743208589] [2024-09-15 20:11:08,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:08,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:08,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:08,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743208589] [2024-09-15 20:11:08,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743208589] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:08,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:08,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:08,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185363642] [2024-09-15 20:11:08,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:08,588 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:08,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:08,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:08,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:08,589 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-15 20:11:08,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:08,854 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2024-09-15 20:11:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:08,854 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-15 20:11:08,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:08,855 INFO L225 Difference]: With dead ends: 228 [2024-09-15 20:11:08,855 INFO L226 Difference]: Without dead ends: 228 [2024-09-15 20:11:08,855 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-15 20:11:08,855 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-15 20:11:08,855 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-15 20:11:08,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-09-15 20:11:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2024-09-15 20:11:08,857 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-15 20:11:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 246 transitions. [2024-09-15 20:11:08,857 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 246 transitions. Word has length 145 [2024-09-15 20:11:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:08,857 INFO L474 AbstractCegarLoop]: Abstraction has 227 states and 246 transitions. [2024-09-15 20:11:08,857 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-15 20:11:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 246 transitions. [2024-09-15 20:11:08,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-09-15 20:11:08,858 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:08,858 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-15 20:11:08,858 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-09-15 20:11:08,858 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-15 20:11:08,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:08,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1772198970, now seen corresponding path program 1 times [2024-09-15 20:11:08,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:08,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173168452] [2024-09-15 20:11:08,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:08,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:08,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:08,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173168452] [2024-09-15 20:11:08,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173168452] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:08,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:08,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:08,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102190599] [2024-09-15 20:11:08,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:08,956 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:08,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:08,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:08,957 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-15 20:11:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:09,136 INFO L93 Difference]: Finished difference Result 226 states and 244 transitions. [2024-09-15 20:11:09,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:09,137 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-15 20:11:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:09,137 INFO L225 Difference]: With dead ends: 226 [2024-09-15 20:11:09,138 INFO L226 Difference]: Without dead ends: 226 [2024-09-15 20:11:09,138 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-15 20:11:09,138 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 8 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:09,138 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 188 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:09,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-09-15 20:11:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-09-15 20:11:09,140 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-15 20:11:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 244 transitions. [2024-09-15 20:11:09,141 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 244 transitions. Word has length 148 [2024-09-15 20:11:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:09,141 INFO L474 AbstractCegarLoop]: Abstraction has 226 states and 244 transitions. [2024-09-15 20:11:09,141 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-15 20:11:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 244 transitions. [2024-09-15 20:11:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-09-15 20:11:09,142 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:09,142 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-15 20:11:09,142 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-09-15 20:11:09,142 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-15 20:11:09,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:09,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1840990844, now seen corresponding path program 1 times [2024-09-15 20:11:09,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:09,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582041996] [2024-09-15 20:11:09,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:09,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:09,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:09,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582041996] [2024-09-15 20:11:09,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582041996] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:09,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:09,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:09,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076887251] [2024-09-15 20:11:09,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:09,220 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:09,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:09,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:09,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:09,220 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-15 20:11:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:09,389 INFO L93 Difference]: Finished difference Result 224 states and 241 transitions. [2024-09-15 20:11:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:09,389 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-15 20:11:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:09,390 INFO L225 Difference]: With dead ends: 224 [2024-09-15 20:11:09,390 INFO L226 Difference]: Without dead ends: 224 [2024-09-15 20:11:09,390 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-15 20:11:09,390 INFO L434 NwaCegarLoop]: 152 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:09,390 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-15 20:11:09,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-09-15 20:11:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-09-15 20:11:09,391 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-15 20:11:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 241 transitions. [2024-09-15 20:11:09,392 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 241 transitions. Word has length 151 [2024-09-15 20:11:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:09,392 INFO L474 AbstractCegarLoop]: Abstraction has 224 states and 241 transitions. [2024-09-15 20:11:09,392 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-15 20:11:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 241 transitions. [2024-09-15 20:11:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-09-15 20:11:09,392 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:09,393 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-15 20:11:09,393 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-09-15 20:11:09,393 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-15 20:11:09,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:09,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1774675906, now seen corresponding path program 1 times [2024-09-15 20:11:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:09,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913869681] [2024-09-15 20:11:09,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:09,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:09,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:09,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913869681] [2024-09-15 20:11:09,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913869681] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:09,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:09,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:09,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319671911] [2024-09-15 20:11:09,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:09,500 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:09,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:09,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:09,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:09,500 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-15 20:11:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:09,706 INFO L93 Difference]: Finished difference Result 223 states and 239 transitions. [2024-09-15 20:11:09,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:09,706 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-15 20:11:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:09,707 INFO L225 Difference]: With dead ends: 223 [2024-09-15 20:11:09,707 INFO L226 Difference]: Without dead ends: 223 [2024-09-15 20:11:09,707 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-15 20:11:09,707 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-15 20:11:09,707 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-15 20:11:09,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-09-15 20:11:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-09-15 20:11:09,709 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-15 20:11:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 239 transitions. [2024-09-15 20:11:09,709 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 239 transitions. Word has length 154 [2024-09-15 20:11:09,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:09,709 INFO L474 AbstractCegarLoop]: Abstraction has 223 states and 239 transitions. [2024-09-15 20:11:09,709 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-15 20:11:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 239 transitions. [2024-09-15 20:11:09,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-09-15 20:11:09,710 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:09,710 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-15 20:11:09,710 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-09-15 20:11:09,710 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-15 20:11:09,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:09,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1676949050, now seen corresponding path program 1 times [2024-09-15 20:11:09,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:09,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602281845] [2024-09-15 20:11:09,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:09,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:09,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:09,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602281845] [2024-09-15 20:11:09,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602281845] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:09,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:09,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:09,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117038594] [2024-09-15 20:11:09,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:09,830 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:09,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:09,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:09,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:09,831 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-15 20:11:10,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:10,095 INFO L93 Difference]: Finished difference Result 222 states and 237 transitions. [2024-09-15 20:11:10,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:10,095 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-15 20:11:10,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:10,096 INFO L225 Difference]: With dead ends: 222 [2024-09-15 20:11:10,096 INFO L226 Difference]: Without dead ends: 222 [2024-09-15 20:11:10,096 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-15 20:11:10,096 INFO L434 NwaCegarLoop]: 150 mSDtfsCounter, 66 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:10,096 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-15 20:11:10,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-09-15 20:11:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2024-09-15 20:11:10,098 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-15 20:11:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 237 transitions. [2024-09-15 20:11:10,098 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 237 transitions. Word has length 157 [2024-09-15 20:11:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:10,098 INFO L474 AbstractCegarLoop]: Abstraction has 222 states and 237 transitions. [2024-09-15 20:11:10,098 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-15 20:11:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 237 transitions. [2024-09-15 20:11:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-09-15 20:11:10,099 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:10,099 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-15 20:11:10,099 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-09-15 20:11:10,099 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-15 20:11:10,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997060, now seen corresponding path program 1 times [2024-09-15 20:11:10,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:10,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145898066] [2024-09-15 20:11:10,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:10,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:10,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:10,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145898066] [2024-09-15 20:11:10,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145898066] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:10,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:10,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:10,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968152542] [2024-09-15 20:11:10,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:10,196 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:10,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:10,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:10,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:10,196 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-15 20:11:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:10,445 INFO L93 Difference]: Finished difference Result 221 states and 235 transitions. [2024-09-15 20:11:10,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:10,446 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-15 20:11:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:10,446 INFO L225 Difference]: With dead ends: 221 [2024-09-15 20:11:10,446 INFO L226 Difference]: Without dead ends: 221 [2024-09-15 20:11:10,447 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:10,447 INFO L434 NwaCegarLoop]: 149 mSDtfsCounter, 62 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:10,447 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 153 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:10,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-09-15 20:11:10,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-09-15 20:11:10,449 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-15 20:11:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 235 transitions. [2024-09-15 20:11:10,449 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 235 transitions. Word has length 160 [2024-09-15 20:11:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:10,449 INFO L474 AbstractCegarLoop]: Abstraction has 221 states and 235 transitions. [2024-09-15 20:11:10,449 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-15 20:11:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 235 transitions. [2024-09-15 20:11:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-09-15 20:11:10,450 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:10,450 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:10,450 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-09-15 20:11:10,450 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-15 20:11:10,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:10,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1238059512, now seen corresponding path program 1 times [2024-09-15 20:11:10,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:10,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052655653] [2024-09-15 20:11:10,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:10,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:10,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:10,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052655653] [2024-09-15 20:11:10,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052655653] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:10,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:10,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:10,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73122426] [2024-09-15 20:11:10,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:10,556 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:10,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:10,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:10,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:10,556 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-15 20:11:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:10,778 INFO L93 Difference]: Finished difference Result 220 states and 233 transitions. [2024-09-15 20:11:10,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:10,778 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-15 20:11:10,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:10,779 INFO L225 Difference]: With dead ends: 220 [2024-09-15 20:11:10,779 INFO L226 Difference]: Without dead ends: 220 [2024-09-15 20:11:10,779 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-15 20:11:10,779 INFO L434 NwaCegarLoop]: 148 mSDtfsCounter, 60 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:10,780 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 152 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-09-15 20:11:10,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-09-15 20:11:10,781 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-15 20:11:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 233 transitions. [2024-09-15 20:11:10,782 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 233 transitions. Word has length 163 [2024-09-15 20:11:10,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:10,782 INFO L474 AbstractCegarLoop]: Abstraction has 220 states and 233 transitions. [2024-09-15 20:11:10,782 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-15 20:11:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 233 transitions. [2024-09-15 20:11:10,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-09-15 20:11:10,783 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:10,783 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-15 20:11:10,783 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-09-15 20:11:10,783 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-15 20:11:10,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:10,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2146173754, now seen corresponding path program 1 times [2024-09-15 20:11:10,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:10,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255962689] [2024-09-15 20:11:10,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:10,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:10,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:10,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255962689] [2024-09-15 20:11:10,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255962689] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:10,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:10,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:10,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737351182] [2024-09-15 20:11:10,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:10,884 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:10,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:10,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:10,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:10,885 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-15 20:11:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:11,137 INFO L93 Difference]: Finished difference Result 219 states and 231 transitions. [2024-09-15 20:11:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:11,137 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-15 20:11:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:11,138 INFO L225 Difference]: With dead ends: 219 [2024-09-15 20:11:11,138 INFO L226 Difference]: Without dead ends: 219 [2024-09-15 20:11:11,138 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-15 20:11:11,138 INFO L434 NwaCegarLoop]: 147 mSDtfsCounter, 54 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:11,138 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 151 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:11,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-09-15 20:11:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-09-15 20:11:11,140 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-15 20:11:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 231 transitions. [2024-09-15 20:11:11,140 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 231 transitions. Word has length 166 [2024-09-15 20:11:11,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:11,140 INFO L474 AbstractCegarLoop]: Abstraction has 219 states and 231 transitions. [2024-09-15 20:11:11,140 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-15 20:11:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 231 transitions. [2024-09-15 20:11:11,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-09-15 20:11:11,141 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:11,141 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-15 20:11:11,141 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-09-15 20:11:11,141 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-15 20:11:11,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:11,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1778550196, now seen corresponding path program 1 times [2024-09-15 20:11:11,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:11,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106790817] [2024-09-15 20:11:11,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:11,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:11,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:11,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106790817] [2024-09-15 20:11:11,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106790817] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:11,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:11,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:11,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299124049] [2024-09-15 20:11:11,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:11,236 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:11,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:11,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:11,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:11,237 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-15 20:11:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:11,433 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2024-09-15 20:11:11,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:11,434 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-15 20:11:11,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:11,434 INFO L225 Difference]: With dead ends: 218 [2024-09-15 20:11:11,434 INFO L226 Difference]: Without dead ends: 218 [2024-09-15 20:11:11,435 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-15 20:11:11,435 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-15 20:11:11,435 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-15 20:11:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-09-15 20:11:11,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-09-15 20:11:11,436 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-15 20:11:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 229 transitions. [2024-09-15 20:11:11,437 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 229 transitions. Word has length 169 [2024-09-15 20:11:11,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:11,437 INFO L474 AbstractCegarLoop]: Abstraction has 218 states and 229 transitions. [2024-09-15 20:11:11,437 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-15 20:11:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 229 transitions. [2024-09-15 20:11:11,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-09-15 20:11:11,437 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:11,438 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-15 20:11:11,438 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-09-15 20:11:11,438 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-15 20:11:11,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:11,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2071729146, now seen corresponding path program 1 times [2024-09-15 20:11:11,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:11,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317204794] [2024-09-15 20:11:11,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:11,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:11,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:11,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:11,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317204794] [2024-09-15 20:11:11,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317204794] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:11,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:11,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:11,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522467161] [2024-09-15 20:11:11,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:11,559 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:11,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:11,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:11,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:11,560 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-15 20:11:11,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:11,750 INFO L93 Difference]: Finished difference Result 217 states and 227 transitions. [2024-09-15 20:11:11,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:11,750 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-15 20:11:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:11,751 INFO L225 Difference]: With dead ends: 217 [2024-09-15 20:11:11,751 INFO L226 Difference]: Without dead ends: 217 [2024-09-15 20:11:11,751 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:11,751 INFO L434 NwaCegarLoop]: 145 mSDtfsCounter, 48 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:11,751 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 149 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:11,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-09-15 20:11:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-09-15 20:11:11,753 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-15 20:11:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 227 transitions. [2024-09-15 20:11:11,753 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 227 transitions. Word has length 172 [2024-09-15 20:11:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:11,753 INFO L474 AbstractCegarLoop]: Abstraction has 217 states and 227 transitions. [2024-09-15 20:11:11,753 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-15 20:11:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 227 transitions. [2024-09-15 20:11:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-09-15 20:11:11,754 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:11,754 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-15 20:11:11,754 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-09-15 20:11:11,754 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-15 20:11:11,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:11,755 INFO L85 PathProgramCache]: Analyzing trace with hash -202339058, now seen corresponding path program 1 times [2024-09-15 20:11:11,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:11,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622006147] [2024-09-15 20:11:11,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:11,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:11,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:11,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622006147] [2024-09-15 20:11:11,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622006147] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:11,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:11,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:11,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182638299] [2024-09-15 20:11:11,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:11,848 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:11,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:11,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:11,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:11,849 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-15 20:11:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:12,042 INFO L93 Difference]: Finished difference Result 216 states and 225 transitions. [2024-09-15 20:11:12,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:12,043 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-15 20:11:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:12,043 INFO L225 Difference]: With dead ends: 216 [2024-09-15 20:11:12,043 INFO L226 Difference]: Without dead ends: 216 [2024-09-15 20:11:12,044 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-15 20:11:12,044 INFO L434 NwaCegarLoop]: 144 mSDtfsCounter, 42 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:12,044 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 148 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:12,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-09-15 20:11:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-09-15 20:11:12,045 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-15 20:11:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 225 transitions. [2024-09-15 20:11:12,046 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 225 transitions. Word has length 175 [2024-09-15 20:11:12,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:12,046 INFO L474 AbstractCegarLoop]: Abstraction has 216 states and 225 transitions. [2024-09-15 20:11:12,046 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-15 20:11:12,046 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 225 transitions. [2024-09-15 20:11:12,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-09-15 20:11:12,047 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:12,047 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-15 20:11:12,047 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-09-15 20:11:12,047 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-15 20:11:12,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:12,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2043145074, now seen corresponding path program 1 times [2024-09-15 20:11:12,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:12,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086727066] [2024-09-15 20:11:12,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:12,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:12,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:12,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086727066] [2024-09-15 20:11:12,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086727066] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:12,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:12,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:12,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782826276] [2024-09-15 20:11:12,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:12,137 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:12,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:12,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:12,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:12,138 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-15 20:11:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:12,323 INFO L93 Difference]: Finished difference Result 215 states and 223 transitions. [2024-09-15 20:11:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:12,324 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-15 20:11:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:12,324 INFO L225 Difference]: With dead ends: 215 [2024-09-15 20:11:12,324 INFO L226 Difference]: Without dead ends: 215 [2024-09-15 20:11:12,324 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-15 20:11:12,325 INFO L434 NwaCegarLoop]: 143 mSDtfsCounter, 40 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:12,325 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-15 20:11:12,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-09-15 20:11:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-09-15 20:11:12,326 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-15 20:11:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 223 transitions. [2024-09-15 20:11:12,326 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 223 transitions. Word has length 178 [2024-09-15 20:11:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:12,327 INFO L474 AbstractCegarLoop]: Abstraction has 215 states and 223 transitions. [2024-09-15 20:11:12,327 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-15 20:11:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 223 transitions. [2024-09-15 20:11:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-09-15 20:11:12,327 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:12,327 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-15 20:11:12,327 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-09-15 20:11:12,327 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-15 20:11:12,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:12,328 INFO L85 PathProgramCache]: Analyzing trace with hash 942244368, now seen corresponding path program 1 times [2024-09-15 20:11:12,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:12,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510091659] [2024-09-15 20:11:12,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:12,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:12,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:12,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510091659] [2024-09-15 20:11:12,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510091659] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:12,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:12,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:12,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939960083] [2024-09-15 20:11:12,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:12,421 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:12,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:12,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:12,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:12,422 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-15 20:11:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:12,623 INFO L93 Difference]: Finished difference Result 214 states and 221 transitions. [2024-09-15 20:11:12,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:12,623 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-15 20:11:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:12,624 INFO L225 Difference]: With dead ends: 214 [2024-09-15 20:11:12,624 INFO L226 Difference]: Without dead ends: 214 [2024-09-15 20:11:12,624 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-15 20:11:12,624 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-15 20:11:12,625 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-15 20:11:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-09-15 20:11:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-09-15 20:11:12,626 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-15 20:11:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 221 transitions. [2024-09-15 20:11:12,626 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 221 transitions. Word has length 181 [2024-09-15 20:11:12,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:12,626 INFO L474 AbstractCegarLoop]: Abstraction has 214 states and 221 transitions. [2024-09-15 20:11:12,626 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-15 20:11:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 221 transitions. [2024-09-15 20:11:12,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-09-15 20:11:12,627 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:12,627 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-15 20:11:12,628 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-09-15 20:11:12,628 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-15 20:11:12,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1503645104, now seen corresponding path program 1 times [2024-09-15 20:11:12,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:12,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490824442] [2024-09-15 20:11:12,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:12,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:12,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:12,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490824442] [2024-09-15 20:11:12,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490824442] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:12,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:12,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:12,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614935760] [2024-09-15 20:11:12,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:12,726 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:12,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:12,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:12,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:12,727 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-15 20:11:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:12,935 INFO L93 Difference]: Finished difference Result 213 states and 219 transitions. [2024-09-15 20:11:12,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:12,943 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-15 20:11:12,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:12,944 INFO L225 Difference]: With dead ends: 213 [2024-09-15 20:11:12,944 INFO L226 Difference]: Without dead ends: 213 [2024-09-15 20:11:12,944 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-15 20:11:12,944 INFO L434 NwaCegarLoop]: 141 mSDtfsCounter, 32 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:12,944 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 145 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-09-15 20:11:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-09-15 20:11:12,946 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-15 20:11:12,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 219 transitions. [2024-09-15 20:11:12,946 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 219 transitions. Word has length 184 [2024-09-15 20:11:12,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:12,946 INFO L474 AbstractCegarLoop]: Abstraction has 213 states and 219 transitions. [2024-09-15 20:11:12,946 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-15 20:11:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 219 transitions. [2024-09-15 20:11:12,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-09-15 20:11:12,947 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:12,947 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-15 20:11:12,948 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-09-15 20:11:12,948 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-15 20:11:12,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:12,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1418247954, now seen corresponding path program 1 times [2024-09-15 20:11:12,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:12,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179085459] [2024-09-15 20:11:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:12,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:13,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:13,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179085459] [2024-09-15 20:11:13,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179085459] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:13,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:13,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:13,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131585358] [2024-09-15 20:11:13,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:13,041 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:13,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:13,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:13,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:13,042 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-15 20:11:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:13,283 INFO L93 Difference]: Finished difference Result 212 states and 217 transitions. [2024-09-15 20:11:13,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:13,283 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-15 20:11:13,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:13,284 INFO L225 Difference]: With dead ends: 212 [2024-09-15 20:11:13,284 INFO L226 Difference]: Without dead ends: 212 [2024-09-15 20:11:13,284 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-15 20:11:13,285 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.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:13,285 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 144 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-09-15 20:11:13,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-09-15 20:11:13,286 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-15 20:11:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 217 transitions. [2024-09-15 20:11:13,287 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 217 transitions. Word has length 187 [2024-09-15 20:11:13,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:13,287 INFO L474 AbstractCegarLoop]: Abstraction has 212 states and 217 transitions. [2024-09-15 20:11:13,287 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-15 20:11:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 217 transitions. [2024-09-15 20:11:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-09-15 20:11:13,287 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:13,287 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-15 20:11:13,287 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-09-15 20:11:13,288 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-15 20:11:13,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1432160274, now seen corresponding path program 1 times [2024-09-15 20:11:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:13,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883632582] [2024-09-15 20:11:13,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:13,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:13,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:13,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883632582] [2024-09-15 20:11:13,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883632582] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:13,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:13,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:13,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210168591] [2024-09-15 20:11:13,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:13,382 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:13,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:13,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:13,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:13,383 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-15 20:11:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:13,564 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2024-09-15 20:11:13,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:13,564 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-15 20:11:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:13,565 INFO L225 Difference]: With dead ends: 211 [2024-09-15 20:11:13,565 INFO L226 Difference]: Without dead ends: 211 [2024-09-15 20:11:13,565 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-15 20:11:13,565 INFO L434 NwaCegarLoop]: 139 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:13,565 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 143 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:13,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-09-15 20:11:13,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-09-15 20:11:13,566 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-15 20:11:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 215 transitions. [2024-09-15 20:11:13,567 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 215 transitions. Word has length 190 [2024-09-15 20:11:13,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:13,567 INFO L474 AbstractCegarLoop]: Abstraction has 211 states and 215 transitions. [2024-09-15 20:11:13,567 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-15 20:11:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 215 transitions. [2024-09-15 20:11:13,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-09-15 20:11:13,567 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:13,567 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-15 20:11:13,567 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-09-15 20:11:13,567 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-15 20:11:13,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:13,568 INFO L85 PathProgramCache]: Analyzing trace with hash -717732844, now seen corresponding path program 1 times [2024-09-15 20:11:13,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:13,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584252299] [2024-09-15 20:11:13,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:13,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:13,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:13,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584252299] [2024-09-15 20:11:13,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584252299] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:13,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:13,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:13,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495484996] [2024-09-15 20:11:13,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:13,673 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:13,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:13,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:13,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:13,674 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-15 20:11:13,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:13,906 INFO L93 Difference]: Finished difference Result 210 states and 213 transitions. [2024-09-15 20:11:13,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:13,907 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-15 20:11:13,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:13,907 INFO L225 Difference]: With dead ends: 210 [2024-09-15 20:11:13,908 INFO L226 Difference]: Without dead ends: 210 [2024-09-15 20:11:13,908 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:13,908 INFO L434 NwaCegarLoop]: 138 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:13,908 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 142 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 20:11:13,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-09-15 20:11:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-09-15 20:11:13,910 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-15 20:11:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 213 transitions. [2024-09-15 20:11:13,910 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 213 transitions. Word has length 193 [2024-09-15 20:11:13,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:13,910 INFO L474 AbstractCegarLoop]: Abstraction has 210 states and 213 transitions. [2024-09-15 20:11:13,910 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-15 20:11:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 213 transitions. [2024-09-15 20:11:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-09-15 20:11:13,911 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:13,911 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:13,911 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-09-15 20:11:13,911 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-15 20:11:13,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1631283756, now seen corresponding path program 1 times [2024-09-15 20:11:13,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:13,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754230181] [2024-09-15 20:11:13,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:13,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:14,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:14,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754230181] [2024-09-15 20:11:14,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754230181] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:14,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:14,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:14,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819956298] [2024-09-15 20:11:14,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:14,019 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:14,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:14,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:14,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:14,020 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-15 20:11:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:14,250 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2024-09-15 20:11:14,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:14,251 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-15 20:11:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:14,251 INFO L225 Difference]: With dead ends: 209 [2024-09-15 20:11:14,251 INFO L226 Difference]: Without dead ends: 209 [2024-09-15 20:11:14,252 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-15 20:11:14,252 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-15 20:11:14,252 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-15 20:11:14,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-09-15 20:11:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-09-15 20:11:14,253 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-15 20:11:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 211 transitions. [2024-09-15 20:11:14,253 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 211 transitions. Word has length 196 [2024-09-15 20:11:14,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:14,254 INFO L474 AbstractCegarLoop]: Abstraction has 209 states and 211 transitions. [2024-09-15 20:11:14,254 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-15 20:11:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 211 transitions. [2024-09-15 20:11:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-09-15 20:11:14,255 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:14,255 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-15 20:11:14,255 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-09-15 20:11:14,255 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-15 20:11:14,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:14,255 INFO L85 PathProgramCache]: Analyzing trace with hash -18738922, now seen corresponding path program 1 times [2024-09-15 20:11:14,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:14,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26110024] [2024-09-15 20:11:14,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:14,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:14,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:14,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26110024] [2024-09-15 20:11:14,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26110024] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:14,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:14,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:14,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395149724] [2024-09-15 20:11:14,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:14,383 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:14,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:14,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:14,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:14,388 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-15 20:11:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:14,574 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2024-09-15 20:11:14,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:14,575 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-15 20:11:14,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:14,575 INFO L225 Difference]: With dead ends: 208 [2024-09-15 20:11:14,575 INFO L226 Difference]: Without dead ends: 208 [2024-09-15 20:11:14,576 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-15 20:11:14,576 INFO L434 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 20:11:14,576 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-15 20:11:14,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-09-15 20:11:14,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-09-15 20:11:14,577 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-15 20:11:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2024-09-15 20:11:14,577 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 199 [2024-09-15 20:11:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:14,578 INFO L474 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2024-09-15 20:11:14,578 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-15 20:11:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2024-09-15 20:11:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-09-15 20:11:14,578 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:14,578 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-15 20:11:14,578 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-09-15 20:11:14,578 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-15 20:11:14,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:14,579 INFO L85 PathProgramCache]: Analyzing trace with hash 95214474, now seen corresponding path program 1 times [2024-09-15 20:11:14,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:14,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746371090] [2024-09-15 20:11:14,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:14,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:11:14,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:14,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746371090] [2024-09-15 20:11:14,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746371090] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:14,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:14,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:14,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88877971] [2024-09-15 20:11:14,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:14,689 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:11:14,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:14,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:11:14,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:11:14,689 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-15 20:11:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:14,897 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2024-09-15 20:11:14,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:11:14,897 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-15 20:11:14,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:14,898 INFO L225 Difference]: With dead ends: 211 [2024-09-15 20:11:14,898 INFO L226 Difference]: Without dead ends: 211 [2024-09-15 20:11:14,898 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-15 20:11:14,898 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.2s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:14,899 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.2s Time] [2024-09-15 20:11:14,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-09-15 20:11:14,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-09-15 20:11:14,900 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-15 20:11:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2024-09-15 20:11:14,900 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 202 [2024-09-15 20:11:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:14,900 INFO L474 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2024-09-15 20:11:14,900 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-15 20:11:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2024-09-15 20:11:14,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-09-15 20:11:14,901 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:14,901 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-09-15 20:11:14,901 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-15 20:11:14,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:14,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1856680139, now seen corresponding path program 1 times [2024-09-15 20:11:14,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:14,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569932126] [2024-09-15 20:11:14,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:14,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:15,055 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-15 20:11:15,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:15,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569932126] [2024-09-15 20:11:15,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569932126] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:11:15,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880709544] [2024-09-15 20:11:15,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:15,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:11:15,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:11:15,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 20:11:15,058 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-15 20:11:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:15,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-15 20:11:15,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:11:15,430 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-15 20:11:15,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:11:15,666 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-15 20:11:15,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880709544] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 20:11:15,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 20:11:15,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-09-15 20:11:15,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910481192] [2024-09-15 20:11:15,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 20:11:15,667 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 20:11:15,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:15,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 20:11:15,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:11:15,668 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-15 20:11:15,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:15,935 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2024-09-15 20:11:15,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 20:11:15,935 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-15 20:11:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:15,936 INFO L225 Difference]: With dead ends: 214 [2024-09-15 20:11:15,936 INFO L226 Difference]: Without dead ends: 214 [2024-09-15 20:11:15,936 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-15 20:11:15,937 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-15 20:11:15,937 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-15 20:11:15,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-09-15 20:11:15,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-09-15 20:11:15,938 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-15 20:11:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 215 transitions. [2024-09-15 20:11:15,938 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 215 transitions. Word has length 205 [2024-09-15 20:11:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:15,938 INFO L474 AbstractCegarLoop]: Abstraction has 214 states and 215 transitions. [2024-09-15 20:11:15,938 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-15 20:11:15,939 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 215 transitions. [2024-09-15 20:11:15,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-09-15 20:11:15,939 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:15,939 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-15 20:11:15,952 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-15 20:11:16,140 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-15 20:11:16,140 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-15 20:11:16,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:16,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1769883626, now seen corresponding path program 2 times [2024-09-15 20:11:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:16,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939042755] [2024-09-15 20:11:16,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:16,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:16,353 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-15 20:11:16,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:16,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939042755] [2024-09-15 20:11:16,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939042755] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:11:16,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268336504] [2024-09-15 20:11:16,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-15 20:11:16,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:11:16,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:11:16,355 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-15 20:11:16,356 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-15 20:11:16,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-15 20:11:16,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 20:11:16,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-15 20:11:16,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:11:16,682 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-15 20:11:16,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:11:16,904 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-15 20:11:16,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268336504] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 20:11:16,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 20:11:16,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-09-15 20:11:16,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690648252] [2024-09-15 20:11:16,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 20:11:16,905 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-15 20:11:16,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:16,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-15 20:11:16,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-15 20:11:16,906 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-15 20:11:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:17,230 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2024-09-15 20:11:17,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 20:11:17,230 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-15 20:11:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:17,231 INFO L225 Difference]: With dead ends: 217 [2024-09-15 20:11:17,231 INFO L226 Difference]: Without dead ends: 217 [2024-09-15 20:11:17,231 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-15 20:11:17,231 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-15 20:11:17,232 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-15 20:11:17,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-09-15 20:11:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-09-15 20:11:17,233 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-15 20:11:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2024-09-15 20:11:17,234 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 208 [2024-09-15 20:11:17,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:17,234 INFO L474 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2024-09-15 20:11:17,234 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-15 20:11:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2024-09-15 20:11:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-09-15 20:11:17,235 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:17,235 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-15 20:11:17,249 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-15 20:11:17,435 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-15 20:11:17,436 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-15 20:11:17,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:17,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1585277035, now seen corresponding path program 3 times [2024-09-15 20:11:17,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:17,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219939236] [2024-09-15 20:11:17,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:17,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:17,676 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-15 20:11:17,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:17,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219939236] [2024-09-15 20:11:17,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219939236] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:11:17,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915280618] [2024-09-15 20:11:17,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-15 20:11:17,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:11:17,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:11:17,678 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-15 20:11:17,680 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-15 20:11:17,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-15 20:11:17,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 20:11:17,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-09-15 20:11:17,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:11:19,322 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-15 20:11:19,322 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-15 20:11:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915280618] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:19,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-15 20:11:19,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-09-15 20:11:19,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127633845] [2024-09-15 20:11:19,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:19,323 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 20:11:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:19,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 20:11:19,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-09-15 20:11:19,324 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-15 20:11:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:20,560 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2024-09-15 20:11:20,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 20:11:20,561 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-15 20:11:20,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:20,562 INFO L225 Difference]: With dead ends: 216 [2024-09-15 20:11:20,562 INFO L226 Difference]: Without dead ends: 216 [2024-09-15 20:11:20,562 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-09-15 20:11:20,562 INFO L434 NwaCegarLoop]: 136 mSDtfsCounter, 5 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:20,564 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 142 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-15 20:11:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-09-15 20:11:20,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2024-09-15 20:11:20,565 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-15 20:11:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2024-09-15 20:11:20,566 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 211 [2024-09-15 20:11:20,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:20,566 INFO L474 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2024-09-15 20:11:20,566 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-15 20:11:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2024-09-15 20:11:20,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-09-15 20:11:20,567 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:20,567 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-15 20:11:20,585 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-15 20:11:20,768 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-15 20:11:20,771 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-15 20:11:20,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:20,772 INFO L85 PathProgramCache]: Analyzing trace with hash -471529024, now seen corresponding path program 1 times [2024-09-15 20:11:20,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:20,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283744779] [2024-09-15 20:11:20,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:20,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:21,532 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-15 20:11:21,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:21,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283744779] [2024-09-15 20:11:21,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283744779] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:21,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:21,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:11:21,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840866081] [2024-09-15 20:11:21,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:21,533 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:11:21,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:21,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:11:21,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:11:21,533 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-15 20:11:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:21,765 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2024-09-15 20:11:21,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:11:21,765 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-15 20:11:21,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:21,766 INFO L225 Difference]: With dead ends: 213 [2024-09-15 20:11:21,766 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 20:11:21,766 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:11:21,766 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-15 20:11:21,766 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-15 20:11:21,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 20:11:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 20:11:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:11:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 20:11:21,767 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2024-09-15 20:11:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:21,767 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 20:11:21,767 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-15 20:11:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 20:11:21,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 20:11:21,769 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 68 remaining) [2024-09-15 20:11:21,770 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 68 remaining) [2024-09-15 20:11:21,770 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 68 remaining) [2024-09-15 20:11:21,770 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 68 remaining) [2024-09-15 20:11:21,770 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 68 remaining) [2024-09-15 20:11:21,770 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 68 remaining) [2024-09-15 20:11:21,770 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 68 remaining) [2024-09-15 20:11:21,770 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 68 remaining) [2024-09-15 20:11:21,770 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 68 remaining) [2024-09-15 20:11:21,770 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 68 remaining) [2024-09-15 20:11:21,770 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 68 remaining) [2024-09-15 20:11:21,770 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 68 remaining) [2024-09-15 20:11:21,770 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 68 remaining) [2024-09-15 20:11:21,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 68 remaining) [2024-09-15 20:11:21,772 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 68 remaining) [2024-09-15 20:11:21,773 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 68 remaining) [2024-09-15 20:11:21,773 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 68 remaining) [2024-09-15 20:11:21,774 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 68 remaining) [2024-09-15 20:11:21,774 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 68 remaining) [2024-09-15 20:11:21,774 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 68 remaining) [2024-09-15 20:11:21,774 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 68 remaining) [2024-09-15 20:11:21,774 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 68 remaining) [2024-09-15 20:11:21,774 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 68 remaining) [2024-09-15 20:11:21,774 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 68 remaining) [2024-09-15 20:11:21,774 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 68 remaining) [2024-09-15 20:11:21,774 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 68 remaining) [2024-09-15 20:11:21,775 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 68 remaining) [2024-09-15 20:11:21,775 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION (0 of 68 remaining) [2024-09-15 20:11:21,775 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-09-15 20:11:21,777 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-15 20:11:21,779 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 20:11:21,781 INFO L469 ceAbstractionStarter]: Automizer considered 67 witness invariants [2024-09-15 20:11:21,781 INFO L470 ceAbstractionStarter]: WitnessConsidered=67 [2024-09-15 20:11:21,782 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 08:11:21 BoogieIcfgContainer [2024-09-15 20:11:21,782 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 20:11:21,782 INFO L158 Benchmark]: Toolchain (without parser) took 34256.41ms. Allocated memory was 58.7MB in the beginning and 408.9MB in the end (delta: 350.2MB). Free memory was 25.6MB in the beginning and 277.8MB in the end (delta: -252.2MB). Peak memory consumption was 99.1MB. Max. memory is 16.1GB. [2024-09-15 20:11:21,783 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 44.0MB. Free memory was 28.0MB in the beginning and 28.0MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:11:21,783 INFO L158 Benchmark]: Witness Parser took 0.08ms. Allocated memory is still 58.7MB. Free memory is still 30.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:11:21,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.45ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 25.4MB in the beginning and 39.2MB in the end (delta: -13.8MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-09-15 20:11:21,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.79ms. Allocated memory is still 73.4MB. Free memory was 39.2MB in the beginning and 35.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-15 20:11:21,784 INFO L158 Benchmark]: Boogie Preprocessor took 47.73ms. Allocated memory is still 73.4MB. Free memory was 35.3MB in the beginning and 31.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-15 20:11:21,785 INFO L158 Benchmark]: RCFGBuilder took 929.98ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 30.8MB in the beginning and 60.5MB in the end (delta: -29.7MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-09-15 20:11:21,785 INFO L158 Benchmark]: TraceAbstraction took 32756.13ms. Allocated memory was 92.3MB in the beginning and 408.9MB in the end (delta: 316.7MB). Free memory was 59.9MB in the beginning and 277.8MB in the end (delta: -217.9MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2024-09-15 20:11:21,785 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.14ms. Allocated memory is still 44.0MB. Free memory was 28.0MB in the beginning and 28.0MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.08ms. Allocated memory is still 58.7MB. Free memory is still 30.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 460.45ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 25.4MB in the beginning and 39.2MB in the end (delta: -13.8MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.79ms. Allocated memory is still 73.4MB. Free memory was 39.2MB in the beginning and 35.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.73ms. Allocated memory is still 73.4MB. Free memory was 35.3MB in the beginning and 31.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 929.98ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 30.8MB in the beginning and 60.5MB in the end (delta: -29.7MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * TraceAbstraction took 32756.13ms. Allocated memory was 92.3MB in the beginning and 408.9MB in the end (delta: 316.7MB). Free memory was 59.9MB in the beginning and 277.8MB in the end (delta: -217.9MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 32.7s, OverallIterations: 71, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3937 SdHoareTripleChecker+Valid, 20.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3937 mSDsluCounter, 12531 SdHoareTripleChecker+Invalid, 16.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1976 mSDsCounter, 1272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48289 IncrementalHoareTripleChecker+Invalid, 49561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1272 mSolverCounterUnsat, 10555 mSDtfsCounter, 48289 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1253 GetRequests, 1032 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=0, InterpolantAutomatonStates: 358, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 71 MinimizatonAttempts, 1129 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.9s 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-15 20:11:21,815 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE